Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A035954
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A035954 Number of partitions of n into parts not of the form 13k, 13k+6 or 13k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 5 are greater than 1. +0
1
1, 2, 3, 5, 7, 10, 13, 19, 25, 34, 44, 59, 75, 98, 124, 159, 199, 252, 312, 391, 481, 595, 727, 893, 1084, 1320, 1594, 1928, 2315, 2784, 3325, 3977, 4730, 5627, 6664, 7894, 9310, 10981, 12905, 15162, 17756, 20787, 24263, 28310, 32946, 38317, 44462 (list; graph; listen)
OFFSET

1,2

COMMENT

Case k=6,i=6 of Gordon Theorem.

REFERENCES

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

CROSSREFS

Adjacent sequences: A035951 A035952 A035953 this_sequence A035955 A035956 A035957

Sequence in context: A038083 A060688 A005691 this_sequence A023192 A064480 A115024

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 15 20:12 EDT 2008. Contains 145099 sequences.


AT&T Labs Research