832011
domain: N
Appears in sequences
- Apply partial sum operator twice to Fibonacci numbers.at n=26A001924
- a(0)=1, a(n) = Fibonacci(2n+4) - (2n+3).at n=13A027953
- Solution to the Dancing School Problem with n girls and n+2 boys: f(n,2).at n=24A079921
- Number of length n+2 0..3 arrays with no consecutive three elements summing to more than 3.at n=12A241609