Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A035977
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A035977 Number of partitions of n into parts not of the form 19k, 19k+8 or 19k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 8 are greater than 1. +0
1
1, 2, 3, 5, 7, 11, 15, 21, 29, 40, 52, 71, 92, 121, 156, 202, 256, 328, 412, 520, 649, 811, 1002, 1243, 1526, 1875, 2289, 2794, 3388, 4112, 4960, 5982, 7183, 8619, 10299, 12302, 14638, 17404, 20630, 24431, 28848, 34038, 40053, 47088, 55234 (list; graph; listen)
OFFSET

1,2

COMMENT

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

REFERENCES

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

CROSSREFS

Sequence in context: A035969 A042953 A023028 this_sequence A101049 A035986 A035996

Adjacent sequences: A035974 A035975 A035976 this_sequence A035978 A035979 A035980

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 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research