Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036025
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036025 Number of partitions of n into parts not of form 4k+2, 20k, 20k+2 or 20k-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 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, 1, 2, 3, 3, 4, 6, 8, 9, 11, 15, 19, 22, 27, 35, 42, 49, 59, 73, 88, 102, 121, 147, 174, 202, 237, 282, 331, 382, 445, 523, 608, 699, 808, 940, 1085, 1241, 1426, 1646, 1887, 2150, 2456, 2814, 3210, 3642, 4140, 4717, 5353, 6051, 6848, 7761, 8770, 9879 (list; graph; listen)
OFFSET

1,4

COMMENT

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

REFERENCES

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

CROSSREFS

Sequence in context: A117275 A081230 A036021 this_sequence A036030 A036022 A036026

Adjacent sequences: A036022 A036023 A036024 this_sequence A036026 A036027 A036028

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