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 A123557 #8 Oct 16 2017 02:04:57
%S A123557 0,1,2,4,11,17,37,53,103,255,339,759,1259,1609,2589,5119,9791,12075,
%T A123557 22249,32991,40025,70487,101697,173681,345855,483329,570077,789639,
%U A123557 927405,1274117,3725409,5010687,7755775,8953855,18108417,20792119
%N A123557 a(n) = A064688(n) - 1.
%C A123557 This is the number of partitions of the n-th prime p into distinct odd parts that are less than p.
%H A123557 G. C. Greubel, <a href="/A123557/b123557.txt">Table of n, a(n) for n = 1..1000</a>
%e A123557 a(4)=4 because the fourth prime (7) can be written in four different ways {6+1, 5+2, 4+3, 1+2+4}.
%t A123557 Table[PartitionsQ[Prime[n]] - 1, {n, 50}] (* _G. C. Greubel_, Oct 15 2017 *)
%Y A123557 Cf. A064688.
%K A123557 nonn
%O A123557 1,3
%A A123557 _N. J. A. Sloane_, based on email from Anthony Doran, Nov 18 2006