33384960

Appears in sequences

• a(n) = (Lucas(2n) + Lucas(2n+1)*phi)/kappa(phi/Fibonacci(4n)) where kappa(x) is the sum of successive remainders in computing the Euclidean algorithm for (1,x).at n=5A088913
• Number of length-n 0..7 arrays connected end-around, with no sequence of L<n elements immediately followed by itself (periodic "squarefree").at n=8A215227