|
| |
|
|
A026903
|
|
a(n) = number of multisets S of positive integers satisfying E(S)=n, where E = 2nd elementary symmetric function; e.g. a(9)=4 counts {1,9},{3,3},{1,1,4},{2,2,2,3}.
|
|
0
| |
|
|
1, 1, 2, 2, 2, 3, 2, 3, 4, 3, 3, 5, 3, 4, 6, 4, 4, 6, 4, 6, 7, 4, 5, 9, 6, 6, 8, 6, 7, 9, 5, 9, 9, 6
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
