121368

Appears in sequences

• Apply partial sum operator twice to Fibonacci numbers.at n=22A001924
• a(0)=1, a(n) = Fibonacci(2n+4) - (2n+3).at n=11A027953
• Solution to the Dancing School Problem with n girls and n+2 boys: f(n,2).at n=20A079921
• Difference between n-th Fibonacci number and floored n-th power of Viswanath's constant.at n=25A140443
• A polynomial coefficient triangle sequence:a(n)=vector(a(n-1)).Reverse(vector(a(n-1));a(0)=1;a(1)=1;a[2]=3;p(x,n)=Sum[a(m)*m!*Binomial[x, m], {m, 0, n}].at n=33A176701
• Number of n X n 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=5A298281
• Number of nX6 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=5A298285