165580141
domain: N
Appears in sequences
- a(n) = 3*a(n-1) - a(n-2) for n >= 2, with a(0) = a(1) = 1.at n=21A001519
- Odd Fibonacci numbers.at n=27A014437
- a(0) = 1, a(1) = 1, and a(n) = 4*a(n-1) + a(n-2) for n >= 2.at n=14A015448
- Smallest Fibonacci number beginning with n.at n=16A020345
- Pisot sequence E(2,3).at n=38A020695
- Pisot sequences E(3,5), P(3,5).at n=37A020701
- Pisot sequences E(5,8), P(5,8).at n=36A020712
- a(n) = Fibonacci(prime(n)).at n=12A030426
- a(n) = Fibonacci(4*n + 1).at n=10A033889
- Fibonacci numbers having initial digit '1'.at n=11A045725
- Smallest Fibonacci number beginning "n^2".at n=3A045734
- Pisot sequences L(2,5), E(2,5).at n=19A048575
- Converse numbers: composite Fibonacci numbers Fib(k) that are congruent to Legendre symbol (k/5) mod k.at n=4A048593
- Fibonacci(k) ending with digits of its index number k.at n=5A050816
- Nonprime Fibonacci numbers with a prime index.at n=4A050937
- Fibonacci numbers which are semiprimes.at n=9A053409
- Squarefree Fibonacci numbers.at n=33A061305
- Primitive part of Fibonacci(n).at n=40A061446
- Fibonacci numbers whose digits sum to a prime.at n=18A065398
- Rearrangement of Fibonacci numbers such that the sum of two consecutive terms + 1 is a prime.at n=18A073580