login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A079130
Primes such that iterated sum-of-digits (A038194) is a square.
4
13, 19, 31, 37, 67, 73, 103, 109, 127, 139, 157, 163, 181, 193, 199, 211, 229, 271, 283, 307, 337, 373, 379, 397, 409, 433, 463, 487, 499, 523, 541, 571, 577, 607, 613, 631, 643, 661, 733, 739, 751, 757, 769, 787, 811, 823, 829, 859, 877, 883, 919, 937, 967
OFFSET
1,1
COMMENTS
Primes which are 1 or 4 mod 9. - Charles R Greathouse IV, Sep 04 2014
LINKS
FORMULA
a(n) ~ 3n log n. - Charles R Greathouse IV, Sep 04 2014
MAPLE
select(isprime, map(t -> (9*t+1, 9*t+4), [$1..1000])); # Robert Israel, Sep 04 2014
MATHEMATICA
sQ[n_]:=MemberQ[{1, 4, 9}, NestWhile[Total[IntegerDigits[#]]&, n, #>9&]]; Select[Prime[Range[300]], sQ] (* Harvey P. Dale, Dec 06 2012 *)
PROG
(PARI) forprime(p=2, 1000, if(issquare(p%9), print1(p, ", ")))
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
Klaus Brockhaus, Dec 28 2002
STATUS
approved