9227465

Appears in sequences

• a(n) = 3*a(n-1) - a(n-2) for n >= 2, with a(0) = a(1) = 1.at n=18A001519
• a(n) = 3*a(n-2) - a(n-4), a(0)=2, a(1)=1, a(2)=3, a(3)=2. Alternates Lucas (A000032) and Fibonacci (A000045) sequences for even and odd n.at n=35A005247
• a(n) = Fibonacci(Fibonacci(n+1) + 1).at n=8A005370
• Odd Fibonacci numbers.at n=23A014437
• a(0) = 1, a(1) = 1, and a(n) = 4*a(n-1) + a(n-2) for n >= 2.at n=12A015448
• Pisot sequence E(2,3).at n=32A020695
• Pisot sequences E(3,5), P(3,5).at n=31A020701
• Pisot sequences E(5,8), P(5,8).at n=30A020712
• a(n) = Fibonacci(4*n+3).at n=8A033891
• a(n+2) = -a(n+1) + a(n) (signed Fibonacci numbers) with a(-2) = a(-1) = 1; or Fibonacci numbers (A000045) extended to negative indices.at n=37A039834
• Fibonacci numbers having initial digit '9'.at n=1A045733
• Rows of Fibonacci-Pascal triangle.at n=31A045995
• Rows of Fibonacci-Pascal triangle.at n=32A045995
• Pisot sequences L(2,5), E(2,5).at n=16A048575
• Squarefree Fibonacci numbers.at n=28A061305
• Fibonacci numbers with index = digit sum.at n=5A067515
• Squarefree part of F(n) (the Fibonacci numbers): the smallest number such that a(n)*F(n) is a square.at n=34A069110
• Least k such that the maximum number of elements among the continued fractions for k/1, k/2, k/3, k/4, ..., k/k equals n.at n=32A071679
• a(n) is the largest n-digit Fibonacci number.at n=6A072352
• Fibonacci numbers for which the number of prime factors (with multiplicity) is a Fibonacci number.at n=26A073958