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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035953 Number of partitions of n into parts not of the form 13k, 13k+5 or 13k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 5 are greater than 1. 0
1, 2, 3, 5, 6, 10, 13, 18, 24, 33, 42, 57, 72, 94, 119, 153, 190, 242, 299, 374, 460, 570, 695, 855, 1036, 1262, 1523, 1843, 2210, 2660, 3175, 3797, 4514, 5372, 6357, 7533, 8880, 10474, 12306, 14459, 16925, 19818, 23125, 26981, 31392, 36512, 42355 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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

REFERENCES

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

CROSSREFS

Sequence in context: A202823 A013931 A018429 * A195054 A087750 A035959

Adjacent sequences:  A035950 A035951 A035952 * A035954 A035955 A035956

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 16 07:39 EST 2012. Contains 205881 sequences.