18201

Appears in sequences

• Multiplicity of highest weight (or singular) vectors associated with character chi_10 of Monster module.at n=42A034398
• Becomes prime or 4 after exactly 9 iterations of f(x) = sum of prime factors of x.at n=9A048131
• Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 10000-11100-00111-00001 pattern in any orientation.at n=12A147383
• Number of ways to place zero or more nonadjacent 1,0 1,1 2,0 2,1 3,0 4,1 polyhexes in any orientation on a planar nXnXn triangular grid.at n=6A155261
• Number of permutations of 1..n containing the relative rank sequence { 164352 } at any spacing.at n=3A159136
• Triangle related to the divergent series 1^m*1! - 2^m*2! + 3^m*3! - 4^m*4! + ... for m >= -1.at n=49A163940
• a(n) = n^3 + (1-n)^2.at n=26A168297
• Sum of a positive square and a positive cube in at least three ways.at n=31A171385
• Expansion of e.g.f.: exp(x*(1+x)^x).at n=8A202152
• Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having a sum of one or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=25A227161
• Expansion of w_7/(1 + 13*w_7 + 49*w_7^2) in powers of q, where w_7 = (eta(7*q)/eta(q))^4.at n=8A279618
• Number of compositions of n into parts with distinct multiplicities and with exactly nine parts.at n=21A321779
• Table read by rows: T(n, k) = T(n, k-1) + m * T(n-1, n-k) for k > 1, T(n, 1) = T(n-1, n-1), and T(n, 0) = 0^n, for m = 2.at n=40A385895