82320

Appears in sequences

• Number of paraffins.at n=26A006009
• Triangle T(n,k) (n >= 1, 0<=k<=n) giving number of preferential arrangements of n things beginning with k (transposed, then read by rows).at n=31A054255
• Ordered m for which m = k^3*a*b*(a^4 - b^4) determine (unique) solution triples(k,a,b), where k=1,2,3,... and (a,b) are coprime pairs, not both odd (i.e., of opposite parity).at n=36A081779
• Triangle read by rows: T(n,k) = number of preferential arrangements of n things where the first object has rank k.at n=32A090665
• Positive integers i for which A112049(i) == 9.at n=31A112069
• Triangle read by rows, characteristic polynomials of matrices; (n X n bisymmetric matrices in which both diagonals equal the (n-1)-th row of Pascal's triangle with the rest zeros). (n>=0, 0<=k<=ceiling(n/2)).at n=28A140693
• Totally multiplicative sequence with a(p) = 7*(p+3) for prime p.at n=29A167326
• Area A of the triangles such that A, the sides and two medians are integers.at n=6A181928
• Numbers with prime factorization pqr^3s^4.at n=28A190294
• Expansion of (theta_2(q)^8 + 4 * theta_2(q^2)^8) / 256 in powers of q^2.at n=37A204386
• Triangle T(n,k) of weakly graded (3+1)-free partially ordered sets (posets) on n labeled vertices with height k.at n=25A222866
• Number of nX3 0..4 arrays with no element equal to another at a city block distance of exactly two, and new values 0..4 introduced in row major order.at n=4A222941
• Number of nX5 0..4 arrays with no element equal to another at a city block distance of exactly two, and new values 0..4 introduced in row major order.at n=2A222943
• T(n,k) = Number of n X k 0..4 arrays with no element equal to another at a city block distance of exactly two, and new values 0..4 introduced in row major order.at n=23A222944
• T(n,k) = Number of n X k 0..4 arrays with no element equal to another at a city block distance of exactly two, and new values 0..4 introduced in row major order.at n=25A222944
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 177", based on the 5-celled von Neumann neighborhood.at n=16A279603
• Triangle read by rows where T(n,k), n>=1, 1<=k<=n is the number of (0,1)-matrices of size n with the first row and column sum = k and remaining sums = 1.at n=30A308498
• Number of symmetric n X n 01-matrices with maximum number of 1s and no 2 X 2 all-1 submatrix.at n=8A352801
• a(n) is the square of the side length of a simplex whose n-dimensional inner hypervolume is equal to its (n-1)-dimensional surface hypervolume. As a result, the sequence starts at n=2.at n=12A364922
• Expansion of e.g.f. 1 / (exp(-x^2) - x).at n=7A375604