Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036028
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036028 Number of partitions of n into parts not of form 4k+2, 20k, 20k+5 or 20k-5. Also number of partitions in which no odd part is repeated, with at most 4 parts of size less than or equal to 2 and where differences between parts at distance 4 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, 7, 10, 12, 15, 19, 25, 31, 37, 47, 59, 71, 85, 104, 127, 152, 180, 216, 260, 307, 360, 427, 506, 592, 690, 809, 948, 1101, 1274, 1480, 1719, 1983, 2281, 2631, 3033, 3477, 3979, 4560, 5221, 5957, 6782, 7729, 8804, 9995, 11329, 12850 (list; graph; listen)
OFFSET

1,3

COMMENT

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

REFERENCES

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

CROSSREFS

Sequence in context: A122975 A089597 A022957 this_sequence A036033 A124243 A132975

Adjacent sequences: A036025 A036026 A036027 this_sequence A036029 A036030 A036031

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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research