OFFSET
1,1
COMMENTS
Theorem: a(n) is the number of steps needed for the prime A376751(n) to "double" in the normal sequence of primes. More precisely, if A376751(n) = prime(j), then a(n) = A063124(j). For example, A376751(8) = 521 = prime(98), and A063124(98) = 78 = a(8). (The result seems to be off by 1 at n = 4, for reasons I don't understand yet.) - N. J. A. Sloane, Oct 04 2024
PROG
(Python) # uses code in A376750
print([out[4] for out in list(islice(A376750_4gen(), 15))]) # Michael S. Branicky, Oct 03 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Oct 03 2024.
EXTENSIONS
a(14)-a(33) from Michael S. Branicky, Oct 04 2024
a(34)-a(36) from Michael S. Branicky, Oct 07 2024
STATUS
approved