139583862445
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=28A001519
- a(n) = F(F(n)), where F is a Fibonacci number.at n=10A007570
- a(n) = Fibonacci(3*n + 1).at n=18A033887
- a(n) = Fibonacci(4*n+3).at n=13A033891
- Fibonacci numbers having initial digit '1'.at n=15A045725
- Pisot sequences L(2,5), E(2,5).at n=26A048575
- Fibonacci numbers starting with a different Fibonacci number of at least two digits.at n=2A067516
- Fibonacci numbers whose sum of decimal digits is greater than its index.at n=17A068498
- Sequence of Fibonacci numbers whose sum of decimal digits sets a new record.at n=17A068500
- Smallest n-digit Fibonacci number.at n=11A072351
- Rearrangement of Fibonacci numbers such that the sum of two consecutive terms + 1 is a prime.at n=27A073580
- Fibonacci numbers F(k) when k is a product of an even number of distinct primes A030229 (mu(k)=1).at n=15A075734
- Squarefree Fibonacci numbers with an even number of prime factors (mu(n)=1).at n=19A075735
- Squarefree Fibonacci numbers which are the product of an even number of distinct primes and whose index is also squarefree and the product of an even number of distinct primes.at n=6A075740
- Smallest Fibonacci number of the form n*k + 1 with k>0.at n=38A076988
- Greedy frac multiples of sqrt(5): a(1)=1, sum(n>0,frac(a(n)*x))=1 at x=sqrt(5).at n=27A079936
- a(n) = Fibonacci(binomial(n+2,2)).at n=9A081667
- 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=14A084910
- a(n) = Fibonacci(5*n).at n=11A102312
- Smallest m such that 9 is at the n-th position of the decimal representation of the m-th Fibonacci number.at n=9A105719