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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035948 Number of partitions of n into parts not of the form 11k, 11k+5 or 11k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 4 are greater than 1. 0
1, 2, 3, 5, 6, 9, 12, 17, 22, 30, 38, 51, 64, 83, 104, 133, 164, 207, 254, 316, 386, 475, 576, 704, 848, 1027, 1232, 1483, 1768, 2116, 2512, 2989, 3534, 4184, 4926, 5808, 6812, 7996, 9348, 10932, 12735, 14842, 17238, 20022, 23188, 26850, 31008, 35805 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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

REFERENCES

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

CROSSREFS

Sequence in context: A067593 A084993 A046966 * A166048 A094873 A018126

Adjacent sequences:  A035945 A035946 A035947 * A035949 A035950 A035951

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 14 20:38 EST 2012. Contains 205663 sequences.