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 A116865 #11 Aug 29 2019 17:32:51 %S A116865 0,1,0,1,0,0,0,0,1,0,0,1,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,1,0,1,0,0, %T A116865 0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0, %U A116865 1,0,0,0,0,0,0,1,0,1,0,0,0 %N A116865 Characteristic array for partitions with only prime parts. %C A116865 The row length sequence of this array is p(n)=A000041(n) (number of partitions). %C A116865 The partitions of n are ordered according to Abramowitz-Stegun (A-St), pp. 831-2. %H A116865 M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy]. %H A116865 M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards Applied Math. Series 55, Tenth Printing, 1972. %H A116865 W. Lang: <a href="/A116865/a116865.txt">First 10 rows.</a> %F A116865 a(n,k)= 1 if the k-th partition of n, in the Abramowitz-Stegun order, has only prime parts, else 0. See A000040 for the prime numbers. %e A116865 [0];[1, 0]; [1, 0, 0]; [0, 0, 1, 0, 0]; [1, 0, 1, 0, 0, 0, 0]; ... %e A116865 a(4,3)=1 because the third partition of 4 is, in A-St order, (2,2) %e A116865 which has only prime numbers as parts. Each of the other four partitions of 4 %e A116865 has at least one part which is not a prime number. %Y A116865 See also array A116864. %Y A116865 Row sums give A000607(n), n>=1. %K A116865 nonn,easy,tabf %O A116865 1,1 %A A116865 _Wolfdieter Lang_, Mar 24 2006