login
A062481
a(n) = n^prime(n).
11
1, 8, 243, 16384, 48828125, 13060694016, 232630513987207, 144115188075855872, 8862938119652501095929, 100000000000000000000000000000, 191943424957750480504146841291811, 8505622499821102144576131684114829934592, 4695452425098908797088971409337422035076128813
OFFSET
1,2
LINKS
FORMULA
From Amiram Eldar, Nov 18 2020: (Start)
a(n) = n^A000040(n).
Sum_{n>=1} 1/a(n) = A096250. (End)
a(n) == n (mod prime(n)). [Fermat's little theorem] - Nicolas Bělohoubek, Jun 14 2022
MATHEMATICA
Table[n^Prime[n], {n, 20}] (* Harvey P. Dale, Jun 12 2014 *)
PROG
(PARI) a(n)={n^prime(n)} \\ Harry J. Smith, Aug 08 2009
(Python)
from sympy import prime
def a(n): return n**prime(n)
print([a(n) for n in range(1, 14)]) # Michael S. Branicky, Jun 15 2022
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Labos Elemer, Jul 09 2001
EXTENSIONS
More terms from Harvey P. Dale, Jun 12 2014
STATUS
approved