Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A035958
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
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; listen)
OFFSET

1,2

COMMENT

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 this_sequence A035965 A035973 A035982

Adjacent sequences: A035955 A035956 A035957 this_sequence A035959 A035960 A035961

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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research