46366

Appears in sequences

• a(n) = Fibonacci(n+3) - 2.at n=21A001911
• Number of down-up permutations of n+4 starting with n+1.at n=7A006213
• Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1.at n=51A008282
• Read across rows of Euler-Bernoulli or Entringer triangle.at n=34A008283
• Triangle of Euler-Bernoulli or Entringer numbers.at n=48A010094
• Numbers k such that sigma(k) = sigma(k+5).at n=18A015865
• Triangle in which rows are permutations of the rows of A008282.at n=51A064192
• Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.at n=35A078612
• Partial sums of repeated Fibonacci sequence.at n=42A094707
• a(n) = A113655(Fibonacci(n+1)).at n=23A102905
• Numbers that have 11 terms in their Zeckendorf representation.at n=10A179251
• a(2t) = a(2t-1) + 1, a(2t+1) = a(2t) + a(2t-2) for t >= 1, with a(0) = a(1) = 1.at n=41A226538
• a(n) = Fibonacci(2*n) - 2.at n=12A249450
• 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=27A295675
• a(n) = 36*n^2 - 8*n - 2 (n >=1).at n=35A304834
• Number of partitions p of n such that min(p) <= (number of parts of p) <= max(p).at n=44A325343
• Partial sums of L(1) - F(1) + L(2) - F(2) + L(3) - F(3) + ..., where L = A000032 and F = A000045.at n=40A355019
• a(n) = number of subsets of {1, 2, ..., n} that represent the first k divisors of m for some positive integers m and 1 <= k <= A000005(m).at n=35A378314