12752042

Appears in sequences

• a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 2.at n=33A001610
• a(n) = F(2n+1) + F(2n-1) - 1.at n=17A005592
• Number of cyclic binary n-bit strings with no alternating substring of length > 2.at n=33A007039
• Number of (marked) cyclic n-bit binary strings containing no runs of length > 2.at n=33A007040
• a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.at n=34A014217
• a(n) = 5*F(n)^2 + 3*(-1)^n where F(n) are the Fibonacci numbers A000045.at n=17A047946
• a(n) = Fibonacci(n-1) + Fibonacci(n+1) - (-1)^n.at n=34A098600
• a(n) = A014217(n+1) - A115360(n+2).at n=32A142584
• Terms in A014217 pairwise swapped.at n=35A154699
• Continued fraction expansion for exp( Sum_{n>=1} 1/(n*Lucas(n)) ), where Lucas(n) = A000032(n) = ((1+sqrt(5))/2)^n + ((1-sqrt(5))/2)^n.at n=48A174505
• a(n) = a(n-1) + a(n-2) + (-1)^n, with a(0)=0 and a(1)=1.at n=35A181716
• Partial sums of A215602.at n=16A215580
• a(n) = A000045(n) / A105800(n); the n-th Fibonacci number divided by its largest Fibonacci proper divisor.at n=50A280690
• 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=33A295674
• Number of nonempty subsets of {1, ..., n} containing no two cyclically successive elements.at n=34A324015
• a(n) = (-1)^n * A000032(n) - 1.at n=34A355021
• a(n) = Lucas(2*n) + 2*(-1)^n + 1.at n=16A366508