|
Search: id:A114638
|
|
|
| A114638 |
|
Number of partitions of n such that number of parts is equal to the sum of parts counted without multiplicities. |
|
+0
1
|
|
| 1, 0, 0, 2, 1, 1, 0, 2, 2, 3, 5, 5, 6, 9, 7, 8, 14, 12, 16, 21, 28, 32, 43, 47, 61, 68, 84, 89, 109, 126, 140, 170, 198, 227, 261, 323, 362, 427, 501, 581, 658, 794, 880, 1036, 1175, 1355, 1526, 1776, 1985, 2281, 2588, 2943, 3312, 3799, 4271, 4852, 5497
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
EXAMPLE
|
a(10)=3 because we have [5,1,1,1,1,1],[3,3,3,1] and [3,2,2,1,1,1].
|
|
MAPLE
|
a:=proc(n) local P, c, j, S: with(combinat): P:=partition(n): c:=0: for j from 1 to nops(P) do S:=convert(P[j], set): if nops(P[j])=sum(S[i], i=1..nops(S)) then c:=c+1 else c:=c fi: c: od: end: seq(a(n), n=1..35); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 01 2006
|
|
CROSSREFS
|
Sequence in context: A113974 A122860 A123331 this_sequence A123340 A110962 A065715
Adjacent sequences: A114635 A114636 A114637 this_sequence A114639 A114640 A114641
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 18 2006
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 01 2006
|
|
|
Search completed in 0.002 seconds
|
