|
%I #37 Jun 16 2022 10:26:11
%S 1,8,243,16384,48828125,13060694016,232630513987207,
%T 144115188075855872,8862938119652501095929,
%U 100000000000000000000000000000,191943424957750480504146841291811,8505622499821102144576131684114829934592,4695452425098908797088971409337422035076128813
%N a(n) = n^prime(n).
%H Harry J. Smith, <a href="/A062481/b062481.txt">Table of n, a(n) for n = 1..50</a>
%F From _Amiram Eldar_, Nov 18 2020: (Start)
%F a(n) = n^A000040(n).
%F Sum_{n>=1} 1/a(n) = A096250. (End)
%F a(n) == n (mod prime(n)). [Fermat's little theorem] - _Nicolas Bělohoubek_, Jun 14 2022
%t Table[n^Prime[n],{n,20}] (* _Harvey P. Dale_, Jun 12 2014 *)
%o (PARI) a(n)={n^prime(n)} \\ _Harry J. Smith_, Aug 08 2009
%o (Python)
%o from sympy import prime
%o def a(n): return n**prime(n)
%o print([a(n) for n in range(1, 14)]) # _Michael S. Branicky_, Jun 15 2022
%Y Cf. A000040, A000312, A051674, A096250.
%K easy,nonn
%O 1,2
%A _Labos Elemer_, Jul 09 2001
%E More terms from _Harvey P. Dale_, Jun 12 2014
| 