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.

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

Links

Vincenzo Librandi, Table of n, a(n) for n = 1..10000

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

Mathematica

Table[Prime[n]+Mod[n, 2], {n, 1, 100}] (* Vincenzo Librandi, May 11 2025 *)

Prog

(Python)
from sympy import prime
def A350171(n): return prime(n)+n%2 # Chai Wah Wu, Dec 19 2021
(Magma) seq := [NthPrime(n) + (n mod 2) : n in [1..100]]; print seq; // Vincenzo Librandi, May 11 2025

Crossrefs

Cf. A000040, A008864.

Sequence in context: A379720 A034401 A345729 * A240449 A088571 A325834

Adjacent sequences: A350168 A350169 A350170 * A350172 A350173 A350174

Keyword

nonn

Author

Michel Marcus, Dec 18 2021

Status

approved