271442

Appears in sequences

• a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 2.at n=25A001610
• a(n) = F(2n+1) + F(2n-1) - 1.at n=13A005592
• Number of cyclic binary n-bit strings with no alternating substring of length > 2.at n=25A007039
• Number of (marked) cyclic n-bit binary strings containing no runs of length > 2.at n=25A007040
• a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.at n=26A014217
• Integers that appear as ratios of Fibonacci numbers F(kn)/F(k), but omitting Fibonacci numbers F(n)/F(1) and Lucas numbers F(2n)/F(n).at n=27A031122
• a(n) = 5*F(n)^2 + 3*(-1)^n where F(n) are the Fibonacci numbers A000045.at n=13A047946
• a(n) = Fibonacci(n-1) + Fibonacci(n+1) - (-1)^n.at n=26A098600
• a(n) = A014217(n+1) - A115360(n+2).at n=24A142584
• Terms in A014217 pairwise swapped.at n=27A154699
• 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=36A174505
• Numbers k that have 13 terms in their Zeckendorf representation.at n=1A179253
• a(n) = a(n-1) + a(n-2) + (-1)^n, with a(0)=0 and a(1)=1.at n=27A181716
• Subsequence of A014217 (n=2,3,5,6,8,9,11,12,...).at n=16A182642
• Partial sums of A215602.at n=12A215580
• Numbers that are both 1 + square of a prime and twice a prime.at n=20A259979
• a(n) = A000045(A032742(n)) / A000045(A054576(n)), where A000045(n) gives the n-th Fibonacci number, A032742(n) = the largest proper divisor of n, and A054576(n) = A032742(A032742(n)).at n=77A280689
• a(n) = A000045(n) / A105800(n); the n-th Fibonacci number divided by its largest Fibonacci proper divisor.at n=38A280690
• 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=25A295674
• Number of nonempty subsets of {1, ..., n} containing no two cyclically successive elements.at n=26A324015