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 A262436 #9 Sep 24 2015 10:32:23 %S A262436 0,0,0,0,0,1,1,2,0,1,2,1,2,1,1,3,0,1,3,2,2,0,2,2,2,2,2,4,2,1,4,3,3,2, %T A262436 3,3,1,3,4,4,5,0,2,5,2,4,3,2,4,1,4,3,5,2,3,5,1,4,6,2,5,2,2,4,3,3,3,5, %U A262436 3,3,5,2,4,6,3,3,4,2,6,6,3,3,5,3,3,6,3 %N A262436 Number of ways to represent 2n - 1 as p^2 + q^2 + r with p, q, and r prime, and p >= q. %C A262436 k is in A212292 if and only if a((k+1)/2) = 0. %H A262436 Peter Kagey, <a href="/A262436/b262436.txt">Table of n, a(n) for n = 1..10000</a> %F A262436 a(16) = 3 because there are three different ways to represent 16 * 2 - 1 = 31 in the form p^2 + q^2 + r with p, q, and r prime, and p >= q: %F A262436 2^2 + 2^2 + 23, %F A262436 3^3 + 3^3 + 13, %F A262436 5^2 + 2^2 + 2. %Y A262436 Cf. A212292. %K A262436 nonn %O A262436 1,8 %A A262436 _Peter Kagey_, Sep 22 2015