9227466

Appears in sequences

• a(n) = Fibonacci(n) + 1.at n=35A001611
• Fibonacci(n) - (-1)^n.at n=34A007492
• a(n+1) = a(n) - F(n) if > 0, otherwise a(n) + F(n), where F() are Fibonacci numbers; a(0) = 0.at n=36A011369
• Pisot sequences L(4,6), E(4,6).at n=31A020706
• Pisot sequences L(6,9), E(6,9).at n=30A020717
• One of four 3rd-order recurring sequences for which the first derived sequence and the Galois transformed sequence coincide.at n=18A032908
• Pisot sequence L(3,4).at n=32A048577
• 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=34A052959
• a(n) = Fibonacci(4n+3) + 1, or Fibonacci(2n+1)*Lucas(2n+2).at n=8A081005
• a(n) = F(n)*L(n+1) where F=Fibonacci and L=Lucas numbers.at n=17A081714
• a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum_{i = 1..n} (a(i) - a(1)).at n=18A093467
• a(n) = the (1,2)-entry in the matrix P^n + F^n, where the 2 X 2 matrices P and F are defined by P=[0,1;1,0] and F=[0,1;1,1].at n=35A109522
• a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4, with initial terms 0,1,3,3.at n=34A111573
• Smallest nonsquarefree integer > the n-th term of the Fibonacci sequence.at n=34A114555
• Index of 1/n in the Fibonacci (or rabbit) ordering of the positive rationals.at n=32A226271
• Sequence a(n) = 1 + A001519(n+1) appearing in a certain touching problem for three circles and a chord, together with A246638.at n=17A246640
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 1, a(1) = 1, a(2) = 2, a(3) = -2.at n=38A295675
• Number of n X 4 0..1 arrays with every element equal to 1, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=35A298920
• 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=32A301791