63245987

Appears in sequences

• a(n) = Fibonacci(n) + 1.at n=39A001611
• Pisot sequences L(4,6), E(4,6).at n=35A020706
• Pisot sequences L(6,9), E(6,9).at n=34A020717
• One of four 3rd-order recurring sequences for which the first derived sequence and the Galois transformed sequence coincide.at n=20A032908
• Pisot sequence L(3,4).at n=36A048577
• 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=38A052959
• a(n) = Fibonacci(4n+3) + 1, or Fibonacci(2n+1)*Lucas(2n+2).at n=9A081005
• a(n) = F(n)*L(n+1) where F=Fibonacci and L=Lucas numbers.at n=19A081714
• a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum_{i = 1..n} (a(i) - a(1)).at n=20A093467
• Index of 1/n in the Fibonacci (or rabbit) ordering of the positive rationals.at n=36A226271
• Sequence a(n) = 1 + A001519(n+1) appearing in a certain touching problem for three circles and a chord, together with A246638.at n=19A246640
• Number of 2Xn 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=36A301791