login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035952 Number of partitions of n into parts not of the form 13k, 13k+4 or 13k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 5 are greater than 1. 0
1, 2, 3, 4, 6, 9, 12, 17, 22, 30, 39, 52, 66, 86, 109, 139, 174, 220, 272, 340, 419, 517, 632, 775, 940, 1144, 1381, 1668, 2002, 2406, 2873, 3433, 4082, 4852, 5745, 6801, 8018, 9452, 11105, 13039, 15266, 17864, 20845, 24310, 28284, 32881, 38145 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Case k=6,i=4 of Gordon Theorem.

REFERENCES

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

CROSSREFS

Sequence in context: A007604 A013950 A018550 * A105781 A035958 A035965

Adjacent sequences:  A035949 A035950 A035951 * A035953 A035954 A035955

KEYWORD

nonn,easy

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 13:28 EST 2012. Contains 206031 sequences.