This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A067773 #10 Dec 18 2019 00:52:23
%S A067773 4,8,17,29,53,77,117,157,217,289,369,469,585,713,849,1025,1197,1393,
%T A067773 1617,1845,2113,2373,2661,2973,3321,3681,4045,4481,4865,5285,5793,
%U A067773 6253,6785,7341,7949,8513,9169,9765,10473,11233,11969,12733,13541,14337
%N A067773 a(n) is the unique positive integer m which has a self-conjugate partition whose parts are the first n primes.
%C A067773 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.
%F A067773 a(n) = 2 prime(n) + Sum_{i=1..n-1} prime(n-i)*(prime(i+1)-prime(i)) = A014342(n-1) - A014342(n-2).
%e A067773 2+2 = 4; 2+3+3 = 8; 2+2+3+5+5 = 17; ....
%t A067773 a[n_] := 2Prime[n]+Sum[Prime[n-i](Prime[i+1]-Prime[i]), {i, 1, n-1}]
%Y A067773 Cf. A000700, A014342.
%K A067773 easy,nonn
%O A067773 1,1
%A A067773 _Naohiro Nomoto_, Feb 06 2002
%E A067773 Edited by _Dean Hickerson_, Feb 12 2002