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!)
A373802 Primes in A373801 in order of their appearance. 3
2, 7, 29, 137, 7937, 569, 179, 809, 227, 263, 557, 40193, 797, 464897, 303868936193, 3833, 16097, 4457, 2309, 4793, 4937, 10289, 2693, 11057, 3002369, 52673, 27617, 1823, 7433, 1907, 497153, 4133, 269057, 2438716790407169, 2879, 2903, 93377, 2999 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(239) has 3137 decimal digits and is too long for inclusion in the b-file. - Alois P. Heinz, Aug 05 2024
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..238 (first 91 terms from N. J. A. Sloane)
MAPLE
b:= proc(n) option remember; (m->
`if`(isprime(m), ithprime(n)+1, 2*m-1))(b(n-1))
end: b(1):=2:
g:= proc(n) option remember; local k; for k from 1+g(n-1)
while not isprime(b(k)) do od; k
end: g(0):=0:
a:= n-> b(g(n)):
seq(a(n), n=1..38); # Alois P. Heinz, Aug 05 2024
MATHEMATICA
Reap[Module[{n = 1}, Nest[If[n++; PrimeQ[#], Sow[#]; Prime[n] + 1, 2*# - 1] &, 2, 500]]][[2, 1]] (* Paolo Xausa, Aug 07 2024 *)
PROG
(Python)
from itertools import count
from sympy import isprime, nextprime
def A373802_gen(): # generator of terms
a, p = 2, 3
for i in count(1):
if isprime(a):
yield a
a = p+1
else:
a = (a<<1)-1
p = nextprime(p)
A373802_list = list(islice(A373802_gen(), 20)) # Chai Wah Wu, Aug 05 2024
CROSSREFS
Sequence in context: A183608 A307389 A104252 * A018977 A190736 A265000
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Aug 05 2024
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 September 13 16:57 EDT 2024. Contains 375910 sequences. (Running on oeis4.)