3524578

Appears in sequences

• a(n) = 3*a(n-1) - a(n-2) for n >= 2, with a(0) = a(1) = 1.at n=17A001519
• 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=33A005247
• Even Fibonacci numbers; or, Fibonacci(3*n).at n=11A014445
• Pisot sequence E(2,3).at n=30A020695
• Pisot sequences E(3,5), P(3,5).at n=29A020701
• Pisot sequences E(5,8), P(5,8).at n=28A020712
• a(n) = Fibonacci(4*n + 1).at n=8A033889
• 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=35A039834
• Fibonacci numbers having initial digit '3'.at n=4A045727
• Pisot sequences L(2,5), E(2,5).at n=15A048575
• Fibonacci numbers containing no pair of consecutive equal digits (probably finite).at n=25A050762
• Expansion of x/(x^4-3*x^3+4*x^2-2*x+1).at n=32A051111
• Fibonacci numbers whose digit sum is also a Fibonacci number.at n=9A053056
• Earliest sequence with a(a(n)) = Fibonacci(n+1).at n=33A054049
• Squarefree Fibonacci numbers.at n=26A061305
• Fibonacci numbers whose sum of decimal digits is greater than its index.at n=10A068498
• Sequence of Fibonacci numbers whose sum of decimal digits sets a new record.at n=11A068500
• Squarefree part of F(n) (the Fibonacci numbers): the smallest number such that a(n)*F(n) is a square.at n=32A069110
• 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=30A071679
• Fibonacci numbers for which the number of prime factors (with multiplicity) is a Fibonacci number.at n=24A073958