The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062481 a(n) = n^prime(n). 11
1, 8, 243, 16384, 48828125, 13060694016, 232630513987207, 144115188075855872, 8862938119652501095929, 100000000000000000000000000000, 191943424957750480504146841291811, 8505622499821102144576131684114829934592, 4695452425098908797088971409337422035076128813 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A115613 A209540 A085524 * A053089 A090241 A242196
KEYWORD
easy,nonn
AUTHOR
Labos Elemer, Jul 09 2001
EXTENSIONS
More terms from Harvey P. Dale, Jun 12 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 09:49 EDT 2024. Contains 372504 sequences. (Running on oeis4.)