login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A067773
a(n) is the unique positive integer m which has a self-conjugate partition whose parts are the first n primes.
0
4, 8, 17, 29, 53, 77, 117, 157, 217, 289, 369, 469, 585, 713, 849, 1025, 1197, 1393, 1617, 1845, 2113, 2373, 2661, 2973, 3321, 3681, 4045, 4481, 4865, 5285, 5793, 6253, 6785, 7341, 7949, 8513, 9169, 9765, 10473, 11233, 11969, 12733, 13541, 14337
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
a(n) = 2 prime(n) + Sum_{i=1..n-1} prime(n-i)*(prime(i+1)-prime(i)) = A014342(n-1) - A014342(n-2).
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
Sequence in context: A366157 A366069 A026353 * A301145 A008372 A005697
KEYWORD
easy,nonn
AUTHOR
Naohiro Nomoto, Feb 06 2002
EXTENSIONS
Edited by Dean Hickerson, Feb 12 2002
STATUS
approved