109760

Appears in sequences

• Number of ways of writing n as a sum of 8 squares.at n=19A000143
• Theta series of E_8 lattice with respect to deep hole.at n=18A004017
• Theta series of {D_8}* lattice.at n=19A008427
• Numbers k such that the square of d(k) (number of divisors) divides k.at n=35A046754
• Numbers that can be written as k/d(k) in four or more ways, where d(k) = number of divisors of k.at n=12A051346
• a(0) = 1; for n>0, a(n) = 16 times sum of cubes of divisors of n.at n=19A092820
• Product of n^2 and n-th tetrahedral number: a(n) = n^3*(n+1)*(n+2)/6.at n=14A119771
• Triangle read by rows: T(n,k) (n>=0, k=0..n) gives number of connected graphs on n nodes with edge chromatic number k.at n=51A126732
• Triangle read by rows, defined by T(n,k)=binomial(n,k)*|Stirling1(n,k)|, 0<=k<=n.at n=41A187555
• Numbers with prime factorization pq^3r^6.at n=26A190467
• Numbers n such that n = k/d(k) has exactly 4 solutions, where d(k) = number of divisors of k.at n=10A217125
• Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k connected components; n>=1, 1<=k<=n.at n=32A228892
• a(n) = 5*n^3.at n=28A244725
• Number of length 4+3 0..n arrays with some disjoint pairs in every consecutive four terms having the same sum.at n=16A247536
• Number of nX7 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,-1) and new values introduced in order 0..2.at n=2A275265
• T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,-1) and new values introduced in order 0..2.at n=38A275266
• Number of 3 X n 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,-1) and new values introduced in order 0..2.at n=6A275267
• Expansion of phi(x)^6 * phi(-x)^2 in powers of x where phi() is a Ramanujan theta function.at n=38A291124
• p-INVERT of (1,0,0,1,0,0,0,0,0,0,...), where p(S) = 1 - S^4.at n=42A292404
• Consider coefficients U(m,L,k) defined by the identity Sum_{k=1..L} Sum_{j=0..m} A302971(m,j)/A304042(m,j) * k^j * (T-k)^j = Sum_{k=0..m} (-1)^(m-k) * U(m,L,k) * T^k that holds for all positive integers L,m,T. This sequence gives 4-column table read by rows, where the n-th row lists coefficients U(3,n,k) for k = 0, 1, 2, 3; n >= 1.at n=27A316387