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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A244246 Number of partitions of n into 10 parts such that every i-th smallest part (counted with multiplicity) is different from i. 2
1, 10, 46, 139, 329, 660, 1173, 1918, 2938, 4277, 5990, 8123, 10742, 13903, 17678, 22140, 27383, 33487, 40560, 48710, 58055, 68734, 80881, 94657, 110223, 127771, 147478, 169580, 194278, 221842, 252503, 286579, 324327, 366120, 412247, 463132, 519112, 580667 (list; graph; refs; listen; history; text; internal format)
OFFSET

65,2

LINKS

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

CROSSREFS

Column k=10 of A238406.

Sequence in context: A281550 A248575 A081583 * A288117 A213834 A241084

Adjacent sequences:  A244243 A244244 A244245 * A244247 A244248 A244249

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 27 11:25 EDT 2017. Contains 288788 sequences.