cp's OEIS Frontend

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.

A165493 Primes p where the digital sum of p^2 is equal to 19.

This page as a plain text file.
%I A165493 #15 Sep 08 2022 08:45:47
%S A165493 17,37,53,73,89,107,109,127,181,199,269,271,379,503,521,557,701,739,
%T A165493 1009,1061,1097,1151,1171,1439,1511,1601,1619,1747,1801,1871,2251,
%U A165493 3169,3259,3329,3347,3511,3761,3851,3889,4051,4139,4519,4751,4951,5003,5021,5849
%N A165493 Primes p where the digital sum of p^2 is equal to 19.
%H A165493 Vincenzo Librandi, <a href="/A165493/b165493.txt">Table of n, a(n) for n = 1..215</a>
%F A165493 {A000040(i) : A123157(i) = 19} [_R. J. Mathar_, Sep 29 2009]
%e A165493 17 is in the sequence because 17^2=289 and 2+8+9=19.
%e A165493 1801 is in the sequence because 1801^2=3243601 and 3+2+4+3+6+0+1=19.
%p A165493 A007953 := proc(n) add(d,d=convert(n,base,10)) ; end:
%p A165493 A123157 := proc(n) A007953((ithprime(n))^2) ; end:
%p A165493 for n from 1 to 100000 do if A123157(n) = 19 then printf("%d,",ithprime(n)) ; fi; od: # _R. J. Mathar_, Sep 29 2009
%t A165493 Select[Prime[Range[800]], Total[IntegerDigits[#^2]]== 19&] (* _Vincenzo Librandi_, Jun 24 2013 *)
%o A165493 (Magma) [p: p in PrimesUpTo(6000) | &+Intseq(p^2) eq 19]; // _Bruno Berselli_, Jun 24 2013
%K A165493 nonn,base
%O A165493 1,1
%A A165493 _Vincenzo Librandi_, Sep 21 2009
%E A165493 More terms from _R. J. Mathar_, Sep 29 2009