A023575 Number of distinct prime divisors of prime(n)+3.

1, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 2, 2, 3, 3, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 2, 3, 3, 2, 3, 1, 2, 2

Offset

1,2

Links

Robert Israel, Table of n, a(n) for n = 1..10000

Formula

a(n) = omega(prime(n)+3). - Wesley Ivan Hurt, Mar 06 2022

Maple

f:= proc(p) nops(numtheory:-factorset(p+3)) end proc:
map(f, [seq(ithprime(i), i=1..100)]); # Robert Israel, Mar 06 2022

Mathematica

a[n_] := PrimeNu[Prime[n]+3]; Array[a, 100] (* Amiram Eldar, Sep 29 2024 *)

Prog

(PARI) a(n) = omega(prime(n)+3); \\ Amiram Eldar, Sep 29 2024

Crossrefs

Cf. A000040 (prime), A001221 (omega).

Sequence in context: A183028 A114284 A238303 * A215113 A058978 A105446

Adjacent sequences: A023572 A023573 A023574 * A023576 A023577 A023578

Keyword

nonn,easy

Author

Clark Kimberling

Status

approved