Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036032
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036032 Number of partitions of n into parts not of form 4k+2, 24k, 24k+4 or 24k-4. Also number of partitions in which no odd part is repeated, with at most 3 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even. +0
1
1, 1, 2, 3, 4, 5, 6, 9, 12, 14, 18, 24, 30, 36, 45, 57, 69, 83, 101, 124, 150, 177, 212, 257, 305, 358, 425, 505, 594, 694, 813, 956, 1116, 1293, 1504, 1753, 2029, 2339, 2702, 3123, 3593, 4120, 4729, 5430, 6215, 7090, 8094, 9245, 10525, 11955, 13587 (list; graph; listen)
OFFSET

1,3

COMMENT

Case k=6,i=4 of Gordon/Goellnitz/Andrews Theorem.

REFERENCES

G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 114.

CROSSREFS

Sequence in context: A125155 A091179 A036027 this_sequence A008813 A133463 A057492

Adjacent sequences: A036029 A036030 A036031 this_sequence A036033 A036034 A036035

KEYWORD

nonn,easy

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research