Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A008672
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A008672 Expansion of 1/((1-x)(1-x^3)(1-x^5)). +0
2
1, 1, 1, 2, 2, 3, 4, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 17, 18, 20, 22, 23, 25, 27, 29, 31, 33, 35, 37, 40, 42, 44, 47, 49, 52, 55, 57, 60, 63, 66, 69, 72, 75, 78, 82, 85, 88, 92, 95, 99, 103, 106, 110, 114, 118, 122, 126, 130, 134, 139, 143, 147, 152, 156, 161, 166 (list; graph; listen)
OFFSET

0,4

COMMENT

Number of partitions of n into odd parts less than or equal 5.

1/((1-x^2)(1-x^6)(1-x^10)) is the Molien series for the icosahedral group [3,5] of order 120.

REFERENCES

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 120, D(n;1,3,5).

W. Ebeling, Lattices and Codes, Vieweg; 2nd ed., 2002, see p. 164 etc.

F. Hirzebruch, Letter to N. J. A. Sloane, quoted in Ges. Abh. II, 796-798.

F. Klein, Lectures on the Icosahedron ..., 2nd Rev. Ed., 1913; reprinted by Dover, NY, 1956; see pp. 236-243.

J. S. Leon, V. S. Pless and N. J. A. Sloane, Self-dual codes over GF(5), J. Combin. Theory, A 32 (1982), 178-194.

L. Smith, Polynomial Invariants of Finite Groups, Peters, 1995, p. 199 (No. 23).

LINKS

G. Nebe, E. M. Rains and N. J. A. Sloane, Self-Dual Codes and Invariant Theory, Springer, Berlin, 2006.

G. E. Andrews, P. Paule, A. Riese and V. Strehl, MacMahon's partition analysis V. Bijections, recursions and magic squares

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 218

F. J. MacWilliams, C. L. Mallows and N. J. A. Sloane, Generalizations of Gleason's theorem on weight enumerators of self-dual codes, IEEE Trans. Inform. Theory, 18 (1972), 794-805; see p. 802, col. 2, foot.

Index entries for Molien series

FORMULA

a(n) = round((n+3)*(n+6)/30).

a(n) = floor[n^2/30+3n/10+1].

G.f.: 1/((1-x)(1-x^3)(1-x^5)).

a(n)=a(-9-n). - Michael Somos Nov 16 2005

PROGRAM

(PARI) a(n)=(n^2+9*n)\30+1

CROSSREFS

A025799(2n)=a(n).

Sequence in context: A050294 A097950 A011885 this_sequence A097923 A027582 A011880

Adjacent sequences: A008669 A008670 A008671 this_sequence A008673 A008674 A008675

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 6 11:04 EST 2009. Contains 170427 sequences.


AT&T Labs Research