Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036027
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036027 Number of partitions of n into parts not of form 4k+2, 20k, 20k+4 or 20k-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 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, 6, 9, 12, 14, 18, 24, 29, 35, 44, 55, 67, 80, 97, 119, 143, 168, 201, 243, 287, 336, 398, 471, 552, 643, 751, 881, 1025, 1184, 1374, 1597, 1842, 2117, 2440, 2812, 3226, 3689, 4223, 4837, 5520, 6280, 7152, 8148, 9251, 10481, 11883, 13466 (list; graph; listen)
OFFSET

1,3

COMMENT

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

REFERENCES

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

CROSSREFS

Adjacent sequences: A036024 A036025 A036026 this_sequence A036028 A036029 A036030

Sequence in context: A064278 A125155 A091179 this_sequence A036032 A008813 A133463

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research