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!)
A276455 Primes of the form Sum_{k=1..n} k^(k-1). 0
3, 701, 45269999 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Searched up to n = 5000.
a(4) has 38019 digits (1973212031 ... 7493445627) and corresponds to n=9553. - Robert Price, Sep 23 2016; [number of digits in a(4) corrected by Jon E. Schoenfield, Nov 06 2016]
No other primes corresponding to n < 80000. - Robert Price, Mar 17 2017
LINKS
EXAMPLE
3 is in the sequence because 3 is prime and 3 = 2^1 + 1^0.
701 is in the sequence because 701 is prime and 701 = 5^4 + 4^3 + 3^2 + 2^1 + 1^0.
45269999 is in the sequence because 45269999 is prime and 45269999 = 9^8 + 8^7 + 7^6 + 6^5 + 5^4 + 4^3 + 3^2 + 2^1 + 1^0.
MATHEMATICA
Select[Accumulate[Table[n^(n-1), {n, 100}]], PrimeQ] (* Harvey P. Dale, Apr 13 2020 *)
PROG
(Sage)
sum = 0
seq = []
max_n = 2500
for n in range(1, max_n+1):
sum += n^(n-1)
if is_prime(sum):
seq.append(n)
print(seq)
CROSSREFS
Primes in A060946.
Sequence in context: A266639 A203496 A308323 * A231604 A306961 A059120
KEYWORD
nonn,bref
AUTHOR
Robert C. Lyons, Sep 06 2016
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 21:51 EDT 2024. Contains 372523 sequences. (Running on oeis4.)