|
| |
|
|
A098859
|
|
Number of partitions of n into parts each of which is used a different number of times.
|
|
2
| |
|
|
1, 1, 2, 2, 4, 5, 7, 10, 13, 15, 21, 28, 31, 45, 55, 62, 82, 105, 116, 153, 172, 208, 251, 312, 341, 431, 492, 588, 676, 826, 905, 1120, 1249, 1475, 1676, 2003, 2187, 2625, 2922, 3409, 3810, 4481, 4910, 5792, 6382, 7407, 8186, 9527, 10434
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
LINKS
| Maciej Ireneusz Wilczynski, Table of n, a(n) for n = 0..508
|
|
|
EXAMPLE
| a(6)=7 because 6= 4+1+1= 3+3= 3+1+1+1= 2+2+2= 2+1+1+1+1= 1+1+1+1+1+1. Four unrestricted partitions of 6 are not counted by a(6): 5+1, 4+2, 3+2+1 because at least two different summands are each used once; 2+2+1+1 because each summand is used twice.
|
|
|
CROSSREFS
| Sequence in context: A135833 A137200 A026930 * A195012 A034398 A027069
Adjacent sequences: A098856 A098857 A098858 * A098860 A098861 A098862
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| David S Newman (DavidSNewman(AT)hotmail.com), Oct 11 2004
|
|
|
EXTENSIONS
| Corrected and extended by Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 22 2004
|
| |
|
|
