225851433717
domain: N
Appears in sequences
- F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=28A001906
- a(n) = Fibonacci(Fibonacci(n+1) + 1).at n=9A005370
- a(0) = 1, a(1) = 1, and a(n) = 4*a(n-1) + a(n-2) for n >= 2.at n=19A015448
- Smallest Fibonacci number beginning with n.at n=22A020345
- a(n) = Fibonacci(4*n).at n=14A033888
- Fibonacci numbers having initial digit '2'.at n=10A045726
- Rows of Fibonacci-Pascal triangle.at n=39A045995
- Rows of Fibonacci-Pascal triangle.at n=41A045995
- Fibonacci numbers that are not squarefree.at n=11A061899
- Fibonacci numbers F(k) for k not squarefree (A013929).at n=21A075732
- Nonsquarefree Fibonacci numbers whose indices are also not squarefree.at n=8A075739
- Fibonacci numbers with a prime signature that has not occurred earlier.at n=17A085077
- 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=28A088305
- a(n) = Fibonacci(5*n+1).at n=11A099100
- A transform of the Fibonacci numbers.at n=18A099843
- F(P(n)) where P(n) is the unrestricted partition number of n and F(n) is the Fibonacci number.at n=10A100843
- Smallest m such that 2 is at the n-th position of the decimal representation of the m-th Fibonacci number.at n=11A105712
- Smallest m such that 5 is at the n-th position of the decimal representation of the m-th Fibonacci number.at n=9A105715
- Expansion of (x-1)*(x+1) / (8*x^2 + 1 - 3*x + x^4 - 3*x^3).at n=27A108196
- Fibonacci(tetranacci(n)).at n=10A111432