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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035958 Number of partitions of n into parts not of the form 15k, 15k+4 or 15k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 6 are greater than 1. 0
1, 2, 3, 4, 6, 9, 12, 17, 23, 31, 40, 54, 69, 90, 115, 147, 185, 235, 292, 366, 453, 561, 689, 848, 1033, 1261, 1529, 1853, 2233, 2693, 3227, 3869, 4618, 5507, 6543, 7771, 9194, 10872, 12817, 15096, 17732, 20814, 24365, 28501, 33265, 38786, 45133 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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

REFERENCES

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

CROSSREFS

Sequence in context: A018550 A035952 A105781 * A035965 A035973 A035982

Adjacent sequences:  A035955 A035956 A035957 * A035959 A035960 A035961

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 09:00 EST 2012. Contains 205904 sequences.