35676

Appears in sequences

• Row sums of the triangle described in A082200.at n=34A082203
• Number of 4 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 0 and 1 1 1 vertically.at n=8A208502
• Number of nX4 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=4A280394
• T(n,k) = Number of n X k 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=32A280398
• Number of 5Xn 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=3A280403
• Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1<=k<=m positions can be picked in an m X m square grid such that the center of gravity of the k picked positions coincides with one of the picked positions.at n=32A291716
• O.g.f. A(x) satisfies: [x^n] exp( n^2*x - n*A(x) ) = 0 for n >= 1.at n=5A317344
• Numbers k such that there are exactly four biquadratefree powerful numbers (A338325) between k^2 and (k+1)^2.at n=33A338391
• Expansion of e.g.f. (1/x) * Series_Reversion( x*(4 - exp(3*x))/3 ).at n=5A370934