121393

Appears in sequences

• F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=13A001906
• 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=26A005013
• Odd Fibonacci numbers.at n=17A014437
• a(0) = 1, a(1) = 1, and a(n) = 4*a(n-1) + a(n-2) for n >= 2.at n=9A015448
• Smallest Fibonacci number beginning with n.at n=12A020345
• Pisot sequence E(2,3).at n=23A020695
• Pisot sequences E(3,5), P(3,5).at n=22A020701
• Pisot sequences E(5,8), P(5,8).at n=21A020712
• a(n) = Fibonacci(4*n + 2).at n=6A033890
• Values of k for which there are no empty intervals when fractional part(m*phi) for m = 1, ..., k is plotted along [ 0, 1 ] subdivided into k equal regions.at n=28A036415
• Fibonacci numbers having initial digit '1'.at n=6A045725
• Smallest Fibonacci number beginning "n^2".at n=10A045734
• Fibonacci numbers containing no pair of consecutive equal digits (probably finite).at n=20A050762
• Expansion of x/(x^4-3*x^3+4*x^2-2*x+1).at n=26A051111
• a(n) = Fibonacci(n+2) - (1-(-1)^n)/2.at n=24A052952
• 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=25A052959
• Fibonacci numbers which are semiprimes.at n=6A053409
• a(n) = a(n-1) - (-1)^n*a(n-2), a(0)=0, a(1)=1.at n=49A053602
• Squarefree Fibonacci numbers.at n=20A061305
• Fibonacci numbers whose digits sum to a prime.at n=11A065398