Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A035941
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A035941 Number of partitions of n into parts not of the form 9k, 9k+2 or 9k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 3 are greater than 1. +0
2
1, 1, 2, 3, 4, 6, 7, 10, 13, 17, 21, 28, 35, 44, 55, 69, 84, 105, 127, 156, 189, 229, 275, 333, 397, 475, 565, 673, 795, 943, 1109, 1307, 1533, 1798, 2099, 2455, 2855, 3323, 3855, 4472, 5169, 5978, 6890, 7942, 9132, 10495, 12032, 13796, 15778, 18040 (list; graph; listen)
OFFSET

1,3

COMMENT

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

REFERENCES

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

CROSSREFS

Sequence in context: A051424 A137606 A119793 this_sequence A039854 A032480 A163771

Adjacent sequences: A035938 A035939 A035940 this_sequence A035942 A035943 A035944

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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research