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!)
A342953 a(n) is the least prime that starts a string of exactly n primes p_1, p_2, ... p_n where p_{i+1} = A258881(p_i), but A258881(p_n) is not prime. 1
2, 13, 11, 19, 499, 8851471 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
No further terms below 10^9.
LINKS
EXAMPLE
a(3) = 11 because 11, A258881(11) = 13, and A258881(13) = 23 are prime.
MAPLE
f:= proc(n) option remember; local t, x;
x:= n + add(t^2, t=convert(n, base, 10));
if not isprime(x) then 1 else 1+procname(x) fi
end proc:
V:= Vector(6): count:= 0: p:= 1:
while count < 6 do
p:= nextprime(p); v:= f(p);
if v <= N and V[v] = 0 then V[v]:= p; count:= count+1 fi
od:
convert(V, list);
CROSSREFS
Sequence in context: A333493 A244932 A157480 * A355896 A213306 A213307
KEYWORD
nonn,more,base
AUTHOR
J. M. Bergot and Robert Israel, Mar 31 2021
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 April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)