Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036030
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036030 Number of partitions of n into parts not of form 4k+2, 24k, 24k+2 or 24k-2. Also number of partitions in which no odd part is repeated, with 1 part 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, 1, 2, 3, 3, 4, 6, 8, 9, 11, 15, 19, 22, 27, 35, 43, 50, 60, 75, 90, 105, 125, 152, 181, 210, 247, 295, 347, 402, 469, 553, 645, 743, 861, 1004, 1162, 1333, 1535, 1776, 2042, 2332, 2670, 3067, 3507, 3989, 4545, 5190, 5905, 6691, 7589, 8621, 9765 (list; graph; listen)
OFFSET

1,4

COMMENT

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

REFERENCES

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

CROSSREFS

Sequence in context: A081230 A036021 A036025 this_sequence A036022 A036026 A116494

Adjacent sequences: A036027 A036028 A036029 this_sequence A036031 A036032 A036033

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research