25436

Appears in sequences

• a(n) = floor(binomial(n,8)/8).at n=21A011854
• Apply partial sum operator 4 times to partition numbers.at n=15A014161
• Triangle, read by rows, where each column equals the convolution of A032349 with the prior column, starting with column 0 equal to A032349 shift right.at n=40A102230
• a(n) = 2*(n^3 + n^2 + n - 1).at n=23A155120
• G.f.: A(x) = exp( Sum_{n>=1} sigma(n) * C(2*n-1,n) * x^n/n ), a power series in x with integer coefficients.at n=8A156305
• Triangle T(n,k) with the coefficient [x^k] of the series (-1)^(n+1) * (x-1)^(n+1) * Sum_{j>=0} (5+8*j)^n*x^j in row n, column k.at n=11A178640
• Total number of possible standard knight moves on an n X 2n chessboard, if the knight is placed anywhere.at n=40A180319
• Number of arrangements of 5 nonzero numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.at n=8A188251
• Floor-Sqrt transform of numbers of A078678 (Grand Dyck paths with no zigzags).at n=23A192682
• 5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of n X n 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=2A223424
• 5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nX3 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=2A223427
• T(n,k)=5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=12A223432
• Number of length 3 0..n arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean.at n=32A244906
• Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^6)).at n=38A288341
• A331776(n)/4.at n=18A332594
• Expansion of (1/x) * Series_Reversion( x / ((1+x)^2+x^4) ).at n=9A369158