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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035945 Number of partitions of n into parts not of the form 11k, 11k+2 or 11k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 4 are greater than 1. 0
1, 1, 2, 3, 4, 6, 8, 11, 14, 19, 24, 32, 40, 51, 65, 82, 101, 127, 156, 193, 236, 289, 350, 427, 514, 620, 744, 893, 1064, 1271, 1508, 1790, 2116, 2500, 2942, 3464, 4060, 4758, 5560, 6494, 7560, 8801, 10216, 11852, 13720, 15870, 18317, 21133, 24328 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

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

REFERENCES

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

CROSSREFS

Sequence in context: A053270 A003412 A038348 * A094707 A117995 A033834

Adjacent sequences:  A035942 A035943 A035944 * A035946 A035947 A035948

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 04:58 EST 2012. Contains 205985 sequences.