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!)
A067390 Number of distinct prime factors in 2^n + 3. 1
1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 1, 3, 2, 1, 1, 3, 1, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 4, 1, 3, 2, 4, 3, 2, 3, 3, 2, 2, 2, 3, 2, 4, 4, 2, 2, 3, 2, 3, 3, 4, 2, 5, 2, 1, 3, 3, 3, 4, 3, 2, 2, 4, 2, 5, 2, 1, 5, 3, 3, 3, 3, 3, 4, 4, 2, 4, 3, 4, 5, 4, 4, 5, 1, 4, 4, 2, 3, 5, 4, 4, 4, 4, 5, 4, 4, 6, 3, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..699

FORMULA

a(n) = A001221(A062709(n)). - Amiram Eldar, Feb 06 2020

EXAMPLE

a(5) = 2 since 2^5 + 3 = 35 = 5 * 7 has 2 distinct prime factors.

MATHEMATICA

PrimeNu @ Table[2^n + 3, {n, 1, 50}] (* Amiram Eldar, Feb 06 2020 *)

PROG

(Magma) [#PrimeDivisors(2^n+3):n in [1..100]]; // Marius A. Burtea, Feb 06 2020

CROSSREFS

Cf. A001221, A062709.

Sequence in context: A182599 A183015 A183018 * A256945 A282091 A354110

Adjacent sequences:  A067387 A067388 A067389 * A067391 A067392 A067393

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Feb 23 2002

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 26 14:21 EDT 2022. Contains 356999 sequences. (Running on oeis4.)