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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035956 Number of partitions of n into parts not of the form 15k, 15k+2 or 15k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 6 are greater than 1. 0
1, 1, 2, 3, 4, 6, 8, 11, 15, 20, 26, 35, 44, 57, 73, 93, 116, 147, 183, 228, 282, 348, 426, 524, 637, 775, 939, 1136, 1366, 1645, 1969, 2356, 2809, 3345, 3969, 4709, 5564, 6570, 7739, 9105, 10683, 12527, 14651, 17120, 19965, 23257, 27039, 31412, 36420 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

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

REFERENCES

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

CROSSREFS

Sequence in context: A100673 A115671 A105782 * A035963 A035971 A035980

Adjacent sequences:  A035953 A035954 A035955 * A035957 A035958 A035959

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 13 23:23 EST 2012. Contains 205567 sequences.