63245986

Appears in sequences

• a(n) = 3*a(n-1) - a(n-2) for n >= 2, with a(0) = a(1) = 1.at n=20A001519
• Even Fibonacci numbers; or, Fibonacci(3*n).at n=13A014445
• Pisot sequence E(2,3).at n=36A020695
• Pisot sequences E(3,5), P(3,5).at n=35A020701
• Pisot sequences E(5,8), P(5,8).at n=34A020712
• a(n) = Fibonacci(4*n+3).at n=9A033891
• Fibonacci numbers having initial digit '6'.at n=2A045730
• Pisot sequences L(2,5), E(2,5).at n=18A048575
• Fibonacci numbers containing no pair of consecutive equal digits (probably finite).at n=28A050762
• Squarefree Fibonacci numbers.at n=31A061305
• Fibonacci numbers whose digits sum to a prime.at n=17A065398
• Fibonacci numbers whose sum of decimal digits is greater than its index.at n=13A068498
• Squarefree part of F(n) (the Fibonacci numbers): the smallest number such that a(n)*F(n) is a square.at n=38A069110
• 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=36A071679
• a(n) is the largest n-digit Fibonacci number.at n=7A072352
• Fibonacci numbers for which the number of prime factors (with multiplicity) is a Fibonacci number.at n=29A073958
• Deficient Fibonacci numbers.at n=32A074317
• Squarefree Fibonacci numbers with odd number of prime factors.at n=16A074691
• Fibonacci numbers F(k) for k squarefree (A005117).at n=25A075731
• Fibonacci numbers F(k) when k is a product of an even number of distinct primes A030229 (mu(k)=1).at n=12A075734