OFFSET
1,1
COMMENTS
In general, given a finite set of positive integers p(1) < ... < p(n), there's a unique self-conjugate partition using these parts; p(n) occurs p(1) times and p(n-i) occurs p(i+1)-p(i) times for 1<=i<n.
FORMULA
EXAMPLE
2+2 = 4; 2+3+3 = 8; 2+2+3+5+5 = 17; ....
MATHEMATICA
a[n_] := 2Prime[n]+Sum[Prime[n-i](Prime[i+1]-Prime[i]), {i, 1, n-1}]
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Naohiro Nomoto, Feb 06 2002
EXTENSIONS
Edited by Dean Hickerson, Feb 12 2002
STATUS
approved