102334155

Appears in sequences

• F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=20A001906
• Odd Fibonacci numbers.at n=26A014437
• Pisot sequence E(2,3).at n=37A020695
• Pisot sequences E(3,5), P(3,5).at n=36A020701
• Pisot sequences E(5,8), P(5,8).at n=35A020712
• a(n) = Fibonacci(3*n + 1).at n=13A033887
• a(n) = Fibonacci(4*n).at n=10A033888
• Fibonacci numbers having initial digit '1'.at n=10A045725
• Smallest positive Fibonacci number divisible by n.at n=34A047930
• a(n) = Fibonacci(n+2) - (1-(-1)^n)/2.at n=38A052952
• a(2n) = a(2n-1)+a(2n-2), a(2n+1) = a(2n)+a(2n-1)-1, a(0)=2, a(1)=1.at n=39A052959
• Smallest Fibonacci number with n distinct prime factors.at n=6A060319
• Squarefree Fibonacci numbers.at n=32A061305
• a(n) = Fibonacci(phi(n)), a(0) = 0.at n=41A065451
• Fibonacci numbers which are a nontrivial concatenation of Fibonacci numbers.at n=4A066630
• Fibonacci numbers which can be partitioned into groups of digits which are Fibonacci numbers.at n=11A067517
• 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=37A071679
• Smallest n-digit Fibonacci number.at n=8A072351
• Abundant Fibonacci numbers.at n=5A074316
• Fibonacci numbers F(k) for k not squarefree (A013929).at n=13A075732