53316291173
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=27A001519
- a(0) = 1, a(1) = 1, and a(n) = 4*a(n-1) + a(n-2) for n >= 2.at n=18A015448
- a(n) = Fibonacci(prime(n)).at n=15A030426
- a(n) = Fibonacci(4*n + 1).at n=13A033889
- Fibonacci numbers having initial digit '5'.at n=4A045729
- Pisot sequences L(2,5), E(2,5).at n=25A048575
- Converse numbers: composite Fibonacci numbers Fib(k) that are congruent to Legendre symbol (k/5) mod k.at n=5A048593
- Nonprime Fibonacci numbers with a prime index.at n=5A050937
- Fibonacci(k) starting with digits of its index number k.at n=5A052000
- Fibonacci numbers which are semiprimes.at n=10A053409
- Fibonacci numbers whose digits sum to a prime.at n=23A065398
- Squarefree Fibonacci numbers with an even number of prime factors (mu(n)=1).at n=18A075735
- Fibonacci numbers F(k) as k runs through the products of an odd number of distinct primes A030059 (mu(k)=-1).at n=17A075736
- Squarefree Fibonacci numbers whose indices are also squarefree.at n=29A075738
- a(1) = 1, a(n+1) is the largest Fibonacci number <= n*a(n).at n=15A076999
- Greedy frac multiples of sqrt(5): a(1)=1, sum(n>0,frac(a(n)*x))=1 at x=sqrt(5).at n=26A079936
- a(n) = (-1)^n * Fibonacci(2*n+1).at n=26A099496
- Smallest m such that 3 is at the n-th position of the decimal representation of the m-th Fibonacci number.at n=9A105713
- Smallest m such that 5 is at the n-th position of the decimal representation of the m-th Fibonacci number.at n=10A105715
- GCD(F(n),A113222(n)), where F(n) is n-th Fibonacci number.at n=52A111141