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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035974 Number of partitions of n into parts not of the form 19k, 19k+5 or 19k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 8 are greater than 1. 0
1, 2, 3, 5, 6, 10, 13, 19, 25, 35, 45, 62, 79, 104, 133, 173, 217, 279, 348, 440, 546, 683, 840, 1043, 1275, 1567, 1907, 2328, 2815, 3416, 4111, 4957, 5940, 7125, 8498, 10148, 12055, 14327, 16959, 20075, 23673, 27920, 32816, 38562, 45185, 52923 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

REFERENCES

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

LINKS

Table of n, a(n) for n=1..46.

CROSSREFS

Sequence in context: A035959 A036801 A035966 * A035983 A035993 A036004

Adjacent sequences:  A035971 A035972 A035973 * A035975 A035976 A035977

KEYWORD

nonn,easy

AUTHOR

Olivier Gérard

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified December 18 07:22 EST 2014. Contains 252095 sequences.