103683

Appears in sequences

• a(n) = a(n-1) + a(n-2) - 1 for n > 1, a(0)=3, a(1)=2.at n=24A001612
• Integers that appear as ratios of Fibonacci numbers F(kn)/F(k), but omitting Fibonacci numbers F(n)/F(1) and Lucas numbers F(2n)/F(n).at n=22A031122
• a(n) = (n^2 - 1)*(n^2 - 3).at n=18A033596
• a(n) = 5*F(n)^2 + 3*(-1)^n where F(n) are the Fibonacci numbers A000045.at n=12A047946
• a(n) = Lucas(2*n) + 1.at n=12A065034
• Squarefree part of F(n) (the Fibonacci numbers): the smallest number such that a(n)*F(n) is a square.at n=35A069110
• a(n) = Lucas(n) + (-1)^n.at n=24A099925
• Numbers having three 1's in their base-phi representation.at n=13A104626
• Duplicate of A065034.at n=12A107328
• a(0)=1; for n >= 1, a(n) = ceiling(Fibonacci(n)/a(n-1)).at n=50A140829
• Squarefree part of Fibonacci(n^2).at n=5A250093
• a(n) = F(12*n)/(12^2) with the Fibonacci numbers F = A000045.at n=2A253368
• List of numbers L and L + 1, where L = A000032, the Lucas numbers, sorted into increasing order and duplicates removed.at n=46A259626
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 1, a(1) = 2, a(2) = 4, a(3) = 8.at n=23A295674
• Numbers k such that the two perfect powers immediately adjacent to k^2 both have exponents greater than 2.at n=37A340643