Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036031
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036031 Number of partitions of n into parts not of form 4k+2, 24k, 24k+3 or 24k-3. Also number of partitions in which no odd part is repeated, with at most 2 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, 3, 4, 6, 8, 10, 12, 16, 21, 25, 30, 39, 49, 58, 70, 86, 105, 125, 148, 179, 216, 254, 298, 356, 422, 492, 575, 677, 794, 922, 1069, 1246, 1450, 1672, 1926, 2230, 2574, 2952, 3385, 3890, 4461, 5094, 5810, 6638, 7575, 8609, 9775, 11115, 12619 (list; graph; listen)
OFFSET

1,3

COMMENT

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

REFERENCES

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

CROSSREFS

Sequence in context: A036022 A036026 A116494 this_sequence A017818 A155118 A091275

Adjacent sequences: A036028 A036029 A036030 this_sequence A036032 A036033 A036034

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research