33546
domain: N
Appears in sequences
- a(n) = Sum_{m=1..n} Sum_{i=1..m} F(i)*F(i+1) where F(n)=Fibonacci numbers A000045.at n=11A080145
- Number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock commuting with each of its horizontal and vertical 2 X 2 subblock neighbors.at n=10A186465
- Coefficient of x in the reduction by x^2->x+1 of the polynomial p(n,x) defined below in Comments.at n=21A192758
- Number of (n+1)X(1+1) 0..3 arrays colored with the upper median plus the lower median minus the minimum of every 2X2 subblock.at n=2A236195
- Number of (n+1)X(3+1) 0..3 arrays colored with the upper median plus the lower median minus the minimum of every 2X2 subblock.at n=0A236197
- T(n,k) = Number of (n+1) X (k+1) 0..3 arrays colored with the upper median plus the lower median minus the minimum of every 2 X 2 subblock.at n=3A236198
- T(n,k) = Number of (n+1) X (k+1) 0..3 arrays colored with the upper median plus the lower median minus the minimum of every 2 X 2 subblock.at n=5A236198
- Number of partitions p of n such that (number of distinct parts of p) < max(p) - min(p).at n=40A239954
- Expansion of (1/x) * Series_Reversion( x * (1-x)^2 * (1-x^3)^3 ).at n=7A369300