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 A176790 #15 May 07 2021 17:33:27 %S A176790 3137,4357,13457,80657,115601,184901,309137,341057,1008017,1073297, %T A176790 4227137,5541317,11806097,16974401,18576101,22848401,24443137, %U A176790 24542117,27625537,28132417,30913601,39112517,42432197,46049797,46321637,52417601,71132357,84713617,92736901 %N A176790 Honaker primes of the form k^2 + 1. %C A176790 The intersection of A033548 with A002522 or with A002496. %C A176790 The list of associated n is: 56, 66, 116, 284, 340, 430, 556, 584, 1004, 1036, 2056, ... %C A176790 The associated indices in A002496 are: 14, 15, 21, 48, 53, 61, 73, 76, 113, 115, 215, 243, 341, 395, 414, ... %D A176790 M. Aigner, Diskrete Mathematik, Vieweg u. Teubner, 6. Aufl., 2006. %D A176790 E. Grosswald, Representations of Integers as Sums of Squares, Springer-Verlag, Berlin, 1985. %D A176790 H. Scheid, Zahlentheorie, Spektrum Akademischer Verlag, 4. Aufl., 2006. %H A176790 K. D. Bajpai, <a href="/A176790/b176790.txt">Table of n, a(n) for n = 1..1570</a> %e A176790 a(1) = 3137 = 56^2 + 1 = A033548(24). %e A176790 a(2) = 4357 = 66^2 + 1 = A033548(31). %t A176790 fHQ[n_]:=Plus@@IntegerDigits@n==Plus@@IntegerDigits@PrimePi@n;Select[Range[10000]^2+1, PrimeQ[#] && fHQ[#] &] (* _K. D. Bajpai_, Apr 06 2021 *) %o A176790 (PARI) for(n =1, 50000, my(k=n^2+1); if(isprime(k) && vecsum(digits(k))==vecsum(digits(primepi(k))), print1(k, ", "))); \\ _K. D. Bajpai_, Apr 06 2021 %Y A176790 Cf. A000040, A002496, A033548, A176012, A176111, A176465. %K A176790 base,nonn %O A176790 1,1 %A A176790 Ulrich Krug (leuchtfeuer37(AT)gmx.de), Apr 26 2010 %E A176790 Comments tightened by _R. J. Mathar_, Jun 07 2010 %E A176790 a(21)-a(29) from _K. D. Bajpai_, Apr 06 2021