28658

Appears in sequences

• a(n) = Fibonacci(n) + 1.at n=23A001611
• Inverse Moebius transform of Fibonacci numbers 1,1,2,3,5,8,...at n=22A007435
• Fibonacci(n) - (-1)^n.at n=22A007492
• a(n+1) = a(n) - F(n) if > 0, otherwise a(n) + F(n), where F() are Fibonacci numbers; a(0) = 0.at n=24A011369
• Pisot sequences L(4,6), E(4,6).at n=19A020706
• Pisot sequences L(6,9), E(6,9).at n=18A020717
• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Fibonacci numbers), t = A023533.at n=56A024466
• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (F(2), F(3), ...), t = A023533.at n=55A024595
• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A000045, t = A023533.at n=55A025086
• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (F(2), F(3), F(4), ...), t = A023533.at n=54A025109
• One of four 3rd-order recurring sequences for which the first derived sequence and the Galois transformed sequence coincide.at n=12A032908
• Pisot sequence L(3,4).at n=20A048577
• 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=22A052959
• Numbers that are Fibonacci numbers plus or minus 1.at n=41A061489
• a(n) is the sum of the divisors of Fibonacci(n) (A000045).at n=22A063477
• a(n) = Fibonacci(4n+3) + 1, or Fibonacci(2n+1)*Lucas(2n+2).at n=5A081005
• a(n) = F(n)*L(n+1) where F=Fibonacci and L=Lucas numbers.at n=11A081714
• Number of configurations of a variant of the 3-dimensional 3 X 3 X 3 sliding cube puzzle that require a minimum of n moves to be reached, starting with the empty space at mid-edge of one of the 12 edges of the combination cube.at n=10A090578
• Expansion of g.f. Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 7.at n=30A091778
• a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum_{i = 1..n} (a(i) - a(1)).at n=12A093467