Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A035983
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A035983 Number of partitions of n into parts not of the form 21k, 21k+5 or 21k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 9 are greater than 1. +0
1
1, 2, 3, 5, 6, 10, 13, 19, 25, 35, 45, 62, 79, 105, 134, 174, 219, 282, 352, 446, 554, 694, 855, 1063, 1301, 1602, 1952, 2386, 2889, 3511, 4231, 5109, 6130, 7363, 8794, 10515, 12507, 14885, 17642, 20910, 24690, 29157, 34313, 40373, 47366, 55547 (list; graph; listen)
OFFSET

1,2

COMMENT

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

REFERENCES

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

CROSSREFS

Adjacent sequences: A035980 A035981 A035982 this_sequence A035984 A035985 A035986

Sequence in context: A036801 A035966 A035974 this_sequence A035993 A036004 A027339

KEYWORD

nonn,easy

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research