31808

Appears in sequences

• Number of ways of writing n as a sum of 8 squares.at n=12A000143
• Theta series of D_8 lattice.at n=6A008430
• Expansion of Product_{m>=1} (1+x^m)^7.at n=10A022572
• Fourier coefficients of E_{0,4}.at n=12A035016
• Dot product of the squares and the quarter-squares: a(n) = sum(i=1..n, i^2 * floor(i^2/4)).at n=13A060453
• Numbers k such that the number of steps to reach 1 in '3x+1' problem equals tau(k), the number of divisors of k.at n=37A070980
• Triangular array with the first half of the odd-indexed rows of A048004.at n=51A125105
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (0, 1, -1), (1, 0, 0)}.at n=11A148163
• Minimal exponents m such that the fractional part of (10/9)^m obtains a maximum (when starting with m=1).at n=15A153695
• Expansion of e.g.f.: 1/(1-2*tanh(x)).at n=6A190818
• Number of (n+2)X(4+2) 0..1 arrays with every 3X3 subblock sum of the two medians of the central row and column plus the two sums of the diagonal and antidiagonal nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=20A259002
• Expansion of (eta(q)^2 * eta(q^2) * eta(q^4)^3 / eta(q^8)^2)^2 in powers of q.at n=48A259491
• Number of nX7 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=1A278013
• T(n,k)=Number of nXk 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=29A278014
• Number of 2 X n 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=6A278015
• Number of regions in the hyperoctahedral (or cocktail party) graph of order n.at n=15A368755
• G.f. satisfies: A(x) = A( x^3 + 12*x*A(x)^3 )^(1/3), with A(0)=0, A'(0)=1.at n=5A392524