267914296

Appears in sequences

• F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=21A001906
• Even Fibonacci numbers; or, Fibonacci(3*n).at n=14A014445
• Smallest Fibonacci number beginning with n.at n=26A020345
• a(n) = Fibonacci(4*n + 2).at n=10A033890
• Fibonacci numbers having initial digit '2'.at n=7A045726
• Fibonacci numbers containing no pair of consecutive equal digits (probably finite).at n=29A050762
• 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=41A052959
• Fibonacci numbers that are not squarefree.at n=7A061899
• Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and ceiled up (where phi = tau = (sqrt(5)+1)/2).at n=41A063708
• a(n) = Fibonacci(phi(n)), a(0) = 0.at n=43A065451
• Fibonacci numbers whose sum of decimal digits is greater than its index.at n=14A068498
• Sequence of Fibonacci numbers whose sum of decimal digits sets a new record.at n=14A068500
• Abundant Fibonacci numbers.at n=6A074316
• Fibonacci numbers F(k) for k squarefree (A005117).at n=27A075731
• Fibonacci numbers F(k) as k runs through the products of an odd number of distinct primes A030059 (mu(k)=-1).at n=14A075736
• a(0) = 1, a(n) = Fibonacci(2*n). It has the property that a(n) = 1*a(n-1) + 2*a(n-2) + 3*a(n-3) + 4*a(n-4) + ...at n=21A088305
• Nonprime Fibonacci numbers.at n=33A090206
• Sums of two consecutive nonprime Fibonacci numbers (A090206).at n=31A090208
• An inverse Catalan transform of Fibonacci(2n).at n=41A100334
• F(P(n)) where P(n) is the unrestricted partition number of n and F(n) is the Fibonacci number.at n=9A100843