228096

Appears in sequences

• Number of spanning trees with degrees 1 and 3 in K_3 X P_2n.at n=5A003691
• Negated coefficients of Chebyshev T polynomials: a(n) = -A053120(n+10, n), n >= 0.at n=8A006975
• Array of coefficients in Zagier's polynomials P_(n,0)(x).at n=48A075733
• a(n) = n^5 - n^4.at n=12A085538
• Hook products of all partitions of 12.at n=26A093791
• Numbers whose set of base 12 digits is {0,B}, where B base 12 = 11 base 10.at n=16A097258
• Numbers of the form (11^i)*(12^j), with i, j >= 0.at n=19A108218
• Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^6 = I.at n=11A163877
• Number of ways to choose n positive integers less than or equal to 2n such that none of the n integers divides another.at n=43A174094
• Expansion of g.f. (1-x)/(1-12*x).at n=5A196731
• Number of defective 3-colorings of an n X 3 0..2 array connected diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=5A229505
• Number of defective 3-colorings of an n X 6 0..2 array connected diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=2A229508
• T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=30A229510
• T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=33A229510
• L.g.f.: Sum_{n>=1} x^((2*n-1)^2) / ( (2*n-1) * (1 - x^(2*n))^(2*n-1) ).at n=60A293598
• Numbers with a record number of distinct values of the Euler totient function applied to their divisors (A319696).at n=35A328858