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.

A048523 Primes for which only one iteration of 'Prime plus its digit sum equals a prime' is possible.

Original entry on oeis.org

13, 19, 37, 53, 71, 73, 97, 103, 127, 163, 181, 233, 271, 307, 383, 389, 431, 433, 499, 509, 563, 587, 631, 701, 743, 787, 811, 857, 859, 947, 1009, 1049, 1061, 1087, 1153, 1171, 1223, 1283, 1423, 1483, 1489, 1553, 1597, 1601, 1607, 1733, 1801, 1861, 1867
Offset: 1

Views

Author

Patrick De Geest, May 15 1999

Keywords

Comments

Sequence A048519 lists the primes for which at least (rather than exactly) one iteration of A062028 is "possible". See A048524 .. A048527 and A320878 .. A320880 for further subsequences, and A090009 for the list of their initial terms, starting chains of length >= 3 .. 9. - M. F. Hasler, Nov 09 2018

Examples

			prime 1999 -> 1999 + (1+9+9+9) = prime 2027 -> next iteration yields composite 2038.
		

Crossrefs

Programs

  • Mathematica
    ppd1Q[n_]:=PrimeQ[Rest[NestList[#+Total[IntegerDigits[#]]&,n,2]]] == {True,False}; Select[Prime[Range[300]],ppd1Q] (* Harvey P. Dale, Nov 10 2011 *)