login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A244244 Number of partitions of n into 8 parts such that every i-th smallest part (counted with multiplicity) is different from i. 2
1, 8, 29, 71, 142, 245, 384, 567, 792, 1069, 1401, 1796, 2260, 2801, 3427, 4150, 4981, 5925, 7004, 8222, 9602, 11151, 12895, 14838, 17016, 19430, 22120, 25090, 28385, 32004, 36004, 40384, 45203, 50463, 56231, 62506, 69367, 76809, 84919, 93697, 103237, 113534 (list; graph; refs; listen; history; text; internal format)
OFFSET

44,2

LINKS

Alois P. Heinz, Table of n, a(n) for n = 44..1000

CROSSREFS

Column k=8 of A238406.

Sequence in context: A247541 A320695 A093809 * A037157 A288115 A100178

Adjacent sequences:  A244241 A244242 A244243 * A244245 A244246 A244247

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Jun 23 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 14:15 EDT 2019. Contains 322386 sequences. (Running on oeis4.)