39602

Appears in sequences

• a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 2.at n=21A001610
• a(n) = F(2n+1) + F(2n-1) - 1.at n=11A005592
• Number of cyclic binary n-bit strings with no alternating substring of length > 2.at n=21A007039
• Number of (marked) cyclic n-bit binary strings containing no runs of length > 2.at n=21A007040
• a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.at n=22A014217
• 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=20A031122
• a(n) = 5*F(n)^2 + 3*(-1)^n where F(n) are the Fibonacci numbers A000045.at n=11A047946
• a(n) = Fibonacci(n-1) + Fibonacci(n+1) - (-1)^n.at n=22A098600
• Numbers that are the sum of exactly two sets of Fibonacci numbers.at n=38A122194
• a(n) = A014217(n+1) - A115360(n+2).at n=20A142584
• Terms in A014217 pairwise swapped.at n=23A154699
• 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=30A174505
• Numbers that have 11 terms in their Zeckendorf representation.at n=1A179251
• a(n) = a(n-1) + a(n-2) + (-1)^n, with a(0)=0 and a(1)=1.at n=23A181716
• Floor-Sqrt transform of Lucas numbers (A000032).at n=44A192660
• Partial sums of A215602.at n=10A215580
• Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two medians of the central row and column plus the two sums of the diagonal and antidiagonal nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=17A259003
• List of numbers L - 1 and L, where L = A000032, the Lucas numbers, sorted into increasing order and duplicates removed.at n=41A259625
• Numbers that are both 1 + square of a prime and twice a prime.at n=13A259979
• Values of n such that A080221(n)=6; i.e., values of n such that n is divisible by the sum of digits of n when expressed in exactly 6 of the bases b=1...n.at n=31A271311