35168
domain: N
Appears in sequences
- Number of ways of writing n as a sum of 8 squares.at n=13A000143
- Number of hexagonal n-element polyominoes whose graph is a path.at n=12A003104
- Theta series of E_8 lattice with respect to deep hole.at n=12A004017
- Theta series of {D_8}* lattice.at n=13A008427
- a(1) = 1, a(n) = Sum_{k=1}^{n-1} (5^k - 1)/4 a(k).at n=4A015506
- a(0) = 1; for n>0, a(n) = 16 times sum of cubes of divisors of n.at n=13A092820
- Number of circular permutations of length n without modular 3-sequences.at n=6A165962
- Number of circular permutations of length n without modular consecutive triples i,i+2,i+4.at n=6A174075
- Triangle read by rows: number of circular permutations of [1..n] with k modular progressions of rise 1, distance 1 and length 3 (n >= 3, 0 <= k <= n).at n=39A216722
- Triangle read by rows: number of circular permutations of [1..n] with k modular progressions of rise 1, distance 2 and length 3 (n >= 3, 0 <= k <= n).at n=39A216726
- Duplicate of A174075.at n=6A216727
- Expansion of phi(x)^6 * phi(-x)^2 in powers of x where phi() is a Ramanujan theta function.at n=26A291124
- a(n) = 16 times the sum of the cubes of the divisors of 2*n+1.at n=6A318937
- G.f. A(x,y) satisfies: x*y = Sum_{n=-oo..+oo} (-1)^n * x^(n*(n+1)/2) * A(x,y)^n, with coefficients T(n,k) of x^n*y^k in A(x,y) given as a triangle read by rows.at n=61A355350