login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A350171
Add 1 to the 1st prime, then write the 2nd prime, then add 1 to the 3rd prime, then write the 4th prime, etc., alternately adding a 1 or not.
1
3, 3, 6, 7, 12, 13, 18, 19, 24, 29, 32, 37, 42, 43, 48, 53, 60, 61, 68, 71, 74, 79, 84, 89, 98, 101, 104, 107, 110, 113, 128, 131, 138, 139, 150, 151, 158, 163, 168, 173, 180, 181, 192, 193, 198, 199, 212, 223, 228, 229, 234, 239, 242, 251, 258, 263, 270, 271, 278, 281, 284, 293, 308, 311, 314, 317, 332, 337, 348, 349, 354, 359, 368, 373
OFFSET
1,1
REFERENCES
J.-P. Delahaye, Des suites fractales d’entiers, Pour la Science, No. 531 January 2022. Sequence d) p. 82.
MAPLE
[seq(ithprime(n)+(n mod 2), n=1..100)]; # N. J. A. Sloane, Dec 18 2021
PROG
(Python)
from sympy import prime
def A350171(n): return prime(n)+n%2 # Chai Wah Wu, Dec 19 2021
CROSSREFS
Sequence in context: A379720 A034401 A345729 * A240449 A088571 A325834
KEYWORD
nonn
AUTHOR
Michel Marcus, Dec 18 2021
STATUS
approved