39088169

Appears in sequences

• F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=19A001906
• a(n) = 3*a(n-2) - a(n-4), a(0)=0, a(1)=1, a(2)=1, a(3)=4. Alternates Fibonacci (A000045) and Lucas (A000032) sequences for even and odd n.at n=38A005013
• Odd Fibonacci numbers.at n=25A014437
• a(0) = 1, a(1) = 1, and a(n) = 4*a(n-1) + a(n-2) for n >= 2.at n=13A015448
• Pisot sequence E(2,3).at n=35A020695
• Pisot sequences E(3,5), P(3,5).at n=34A020701
• Pisot sequences E(5,8), P(5,8).at n=33A020712
• a(n) = Fibonacci(4*n + 2).at n=9A033890
• Fibonacci numbers having initial digit '3'.at n=5A045727
• Expansion of x/(x^4-3*x^3+4*x^2-2*x+1).at n=37A051111
• a(n) = Fibonacci(n+2) - (1-(-1)^n)/2.at n=36A052952
• a(2n) = a(2n-1)+a(2n-2), a(2n+1) = a(2n)+a(2n-1)-1, a(0)=2, a(1)=1.at n=37A052959
• Fibonacci sieve: using Fibonacci numbers, strike out every 2nd, 3rd, 5th, 8th, 13th, 21st, 34th... of those remaining.at n=10A060390
• Squarefree Fibonacci numbers.at n=30A061305
• Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and ceiled up (where phi = tau = (sqrt(5)+1)/2).at n=37A063708
• Fibonacci numbers whose sum of decimal digits is greater than its index.at n=12A068498
• Sequence of Fibonacci numbers whose sum of decimal digits sets a new record.at n=13A068500
• Squarefree part of F(n) (the Fibonacci numbers): the smallest number such that a(n)*F(n) is a square.at n=37A069110
• Least k such that the maximum number of elements among the continued fractions for k/1, k/2, k/3, k/4, ..., k/k equals n.at n=35A071679
• Smallest Fibonacci number containing exactly n 9's.at n=1A072314