12586269025
domain: N
Appears in sequences
- F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=25A001906
- Odd Fibonacci numbers.at n=33A014437
- a(0) = 1, a(1) = 1, and a(n) = 4*a(n-1) + a(n-2) for n >= 2.at n=17A015448
- a(n) = Fibonacci(4*n + 2).at n=12A033890
- Fibonacci numbers having initial digit '1'.at n=14A045725
- Fibonacci numbers containing no pair of consecutive equal digits (probably finite).at n=32A050762
- Smallest Fibonacci number that is divisible by n-th prime.at n=25A051694
- Fibonacci sieve: using Fibonacci numbers, strike out every 2nd, 3rd, 5th, 8th, 13th, 21st, 34th... of those remaining.at n=12A060390
- Fibonacci numbers that are not squarefree.at n=9A061899
- Smallest Fibonacci number with a prime number of decimal digits.at n=4A064525
- Smallest Fibonacci number containing exactly n 2's.at n=2A072321
- Smallest n-digit Fibonacci number.at n=10A072351
- Fibonacci numbers F(k) for k not squarefree (A013929).at n=18A075732
- Nonsquarefree Fibonacci numbers whose indices are also not squarefree.at n=6A075739
- Fibonacci numbers that satisfy: Sum_{k>=1} 1/a(k) = 1, such that the partial sums are nearest to, but never exceed, unity.at n=13A084908
- Fibonacci numbers that satisfy: Sum_{k>=1} 1/a(k) = tau-1, such that the partial sums are nearest to, but never exceed, tau-1 = (sqrt(5)-1)/2.at n=12A084910
- Fibonacci numbers with a prime signature that has not occurred earlier.at n=15A085077
- 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=25A088305
- A transform of the Fibonacci numbers.at n=16A099843
- a(n) = Fibonacci(5*n).at n=10A102312