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 A095840 #10 Feb 17 2019 23:25:48 %S A095840 0,1,1,2,2,2,3,3,3,3,4,3,3,2,3,4,3,3,7,2,3,3,2,3,2,2,3,7,2,2,3,2,4,4, %T A095840 3,2,2,2,2,2,4,2,3,1,11,3,3,4,0,2,3,1,3,3,3,1,4,1,1,2,4,2,1,3,3,2,1,3, %U A095840 5,1,12,3,2,1,3,2,2,3,2,4,2,1,2,2,0,1,1,3,2,4,2,3,2,0,2,3,1,2,2,2,1,3 %N A095840 Number of ways to write the n-th prime power as sum of two prime powers. %C A095840 a(n) = A071330(A000961(n)). %C A095840 See A095842 and A095841 for prime powers having no more than one partition into two prime powers. %H A095840 Reinhard Zumkeller, <a href="/A095840/b095840.txt">Table of n, a(n) for n = 1..10000</a> %e A095840 A000961(8) = 3^2 = 9 = 1+8 = 2+7 = 4+5, therefore a(8)=3. %o A095840 (Haskell) %o A095840 a095840 = a071330 . a000961 -- _Reinhard Zumkeller_, Jan 11 2013 %K A095840 nonn %O A095840 1,4 %A A095840 _Reinhard Zumkeller_, Jun 10 2004