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.

A130828 Primes p such that the sum of the digits of p^p is a prime.

Original entry on oeis.org

5, 11, 19, 29, 37, 43, 89, 97, 113, 139, 269, 311, 337, 359, 367, 433
Offset: 1

Views

Author

J. M. Bergot, Jul 17 2007

Keywords

Comments

Computed by Emeric Deutsch.

Examples

			For 5^5 = 625, 6 + 2 + 5 = 13, which is a prime.
		

Crossrefs

Programs

  • Maple
    sd := proc (n) options operator, arrow: add(convert(n, base, 10)[j], j = 1 .. nops(convert(n, base, 10))) end proc:
    a := proc (n) if isprime(sd(ithprime(n)^ithprime(n))) = true then ithprime(n) else end if end proc:
    seq(a(n), n = 1 .. 90); # Emeric Deutsch, Jul 19 2007