14930352

Appears in sequences

• F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=18A001906
• 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=36A005013
• Even Fibonacci numbers; or, Fibonacci(3*n).at n=12A014445
• Pisot sequence E(2,3).at n=33A020695
• Pisot sequences E(3,5), P(3,5).at n=32A020701
• Pisot sequences E(5,8), P(5,8).at n=31A020712
• a(n) = Fibonacci(4*n).at n=9A033888
• Fibonacci numbers having initial digit '1'.at n=9A045725
• Rows of Fibonacci-Pascal triangle.at n=47A045995
• Smallest positive Fibonacci number divisible by n.at n=26A047930
• Fibonacci numbers containing no pair of consecutive equal digits (probably finite).at n=26A050762
• Expansion of x/(x^4-3*x^3+4*x^2-2*x+1).at n=36A051111
• a(n) = Fibonacci(n+2) - (1-(-1)^n)/2.at n=34A052952
• 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=35A052959
• (n^2)-th Fibonacci number.at n=6A054783
• Fibonacci sieve: using Fibonacci numbers, strike out every 2nd, 3rd, 5th, 8th, 13th, 21st, 34th... of those remaining.at n=9A060390
• Fibonacci numbers that are not squarefree.at n=6A061899
• a(n) = Fibonacci(phi(n)), a(0) = 0.at n=37A065451
• 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=33A071679
• Smallest n-digit Fibonacci number.at n=7A072351