19648

Appears in sequences

• Number of points of L1 norm 2n in Hamming code version of E_8 lattice.at n=4A010368
• Expansion of Product_{m>=1} (1 + q^m)^48.at n=3A025233
• Number of partitions in parts not of the form 13k, 13k+1 or 13k-1. Also number of partitions with no part of size 1 and differences between parts at distance 5 are greater than 1.at n=49A035949
• Numbers n such that sopf(n) = sopf(n+1) - sopf(n-1), where sopf(x) = sum of the distinct prime factors of x.at n=9A076525
• Numbers equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors. Rearrangements which cause leading zeros are excluded.at n=19A085844
• Numbers n such that n, n+1, n+2, n+3, n+4 are all of the form x^2+2*y^2 for nonnegative x, y.at n=12A096783
• a(n) = Sum_{k|n} a(k) a(n-k) for n >= 2, a(0)=0, a(1)=1.at n=21A097438
• Antidiagonal sums of square array A158825, in which row n lists the coefficients of the n-th iteration of x*C(x), where C(x) is the Catalan function (A000108).at n=9A158829
• Number of ways to place 7n nonattacking kings on a 14 X 2n cylindrical chessboard.at n=2A195004
• Number of ways to place 3n nonattacking kings on a vertical cylinder 6 X 2n.at n=6A195591
• Number of 2 X 2 matrices with all elements in {0,1,...,n} and positive even determinant.at n=15A210372
• Triangle T(n,k), n>=1, 0<=k<=A000041(n), read by rows: row n gives the coefficients of the chromatic polynomial of the ranked poset L(n) of partitions of n, highest powers first.at n=39A213597
• Number of (n+2) X (1+2) 0..2 arrays with each 3 X 3 subblock having the sum of its 72 absolute element differences equal to 34 and no adjacent elements equal.at n=15A234927
• Triangle T(n, k) read by rows: row n gives the coefficients of the numerator polynomials of the o.g.f. of the (n+1)-th diagonal of the Sheffer triangle A154537 (S2[2,1] generalized Stirling2), for n >= 0.at n=37A290315
• Three-column table read by rows: row n gives [number of triangle-triangle, triangle-quadrilateral, quadrilateral-quadrilateral] contacts for a row of n adjacent congruent rectangles divided by drawing diagonals of all possible rectangles (cf. A331452).at n=52A336731