87403802

Appears in sequences

• a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 2.at n=37A001610
• a(n) = F(2n+1) + F(2n-1) - 1.at n=19A005592
• Number of cyclic binary n-bit strings with no alternating substring of length > 2.at n=37A007039
• a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.at n=38A014217
• a(n) = 5*F(n)^2 + 3*(-1)^n where F(n) are the Fibonacci numbers A000045.at n=19A047946
• Cyclotomic polynomials Phi_n at x=phi, ceiled up (where phi = tau = (sqrt(5)+1)/2).at n=37A063707
• a(n) = A014217(n+1) - A115360(n+2).at n=36A142584
• a(n) = a(n-1) + a(n-2) + (-1)^n, with a(0)=0 and a(1)=1.at n=39A181716
• Partial sums of A215602.at n=18A215580
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 1, a(1) = 2, a(2) = 4, a(3) = 8.at n=37A295674
• Number of nonempty subsets of {1, ..., n} containing no two cyclically successive elements.at n=38A324015
• a(n) = Lucas(2*n) + 2*(-1)^n + 1.at n=18A366508