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 A059400 #9 Nov 25 2012 02:31:45 %S A059400 1,3,11,27,77,83,167,293,227,503,437,887,923,1007,1133,1487,2243,2147, %T A059400 2477,2273,2537,3167,3947,4457,4703,3737,3713,5843,6233,8123,8333, %U A059400 5297,11513,10127,9407,10853,10577,13187,8153,12473,8777,15923,16463,17513 %N A059400 a(n) is the least odd number of the form p + k^2 with p prime and k > 0 which can be represented in exactly n different ways. %C A059400 Note that A002471 allows for k to equal zero. %D A059400 David Wells, "The Penguin Dictionary of Curious and Interesting Numbers," Revised Edition, Penguin Books, London, 1997, page 63. %H A059400 Donovan Johnson, <a href="/A059400/b059400.txt">Table of n, a(n) for n = 0..1000</a> %e A059400 a(3) = 27 because 27 = 23+2^2 = 11+4^2 = 2+5^2 and is the least odd number to exhibit this property of 3 representations. %t A059400 a = Table[ 0, {55} ]; Do[ c = 0; k = 1; While[ n - k^2 > 1, If[ PrimeQ[ n - k^2], c++ ]; k++ ]; If[ a[[c]] == 0, a[[c]] = n], { n, 1, 30500, 2} ]; a %Y A059400 Cf. A002471. %K A059400 nonn %O A059400 0,2 %A A059400 _Robert G. Wilson v_, Mar 15 2001 %E A059400 Name clarified by _Donovan Johnson_, Nov 24 2012