Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A035948
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A035948 Number of partitions of n into parts not of the form 11k, 11k+5 or 11k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 4 are greater than 1. +0
1
1, 2, 3, 5, 6, 9, 12, 17, 22, 30, 38, 51, 64, 83, 104, 133, 164, 207, 254, 316, 386, 475, 576, 704, 848, 1027, 1232, 1483, 1768, 2116, 2512, 2989, 3534, 4184, 4926, 5808, 6812, 7996, 9348, 10932, 12735, 14842, 17238, 20022, 23188, 26850, 31008, 35805 (list; graph; listen)
OFFSET

1,2

COMMENT

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

REFERENCES

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

CROSSREFS

Sequence in context: A067593 A084993 A046966 this_sequence A094873 A018126 A087900

Adjacent sequences: A035945 A035946 A035947 this_sequence A035949 A035950 A035951

KEYWORD

nonn,easy

AUTHOR

Olivier Gerard (ogerard(AT)ext.jussieu.fr)

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research