login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136034 a(n) = smallest number k such that number of distinct prime factors of numbers 2^k-1 A000225 is exactly n. 0
2, 4, 8, 12, 20, 24, 40, 36, 48, 88, 60, 72, 150, 132, 120, 156, 144, 200, 204, 210, 180, 324, 476, 288, 300, 432, 396, 480, 360, 468, 576, 700, 504, 420, 648, 540, 660, 792, 720 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

First occurrence of n in A046800

LINKS

Table of n, a(n) for n=1..39.

CROSSREFS

Cf. A000225, A003260, A016047, A046051, A046800, A049479, A088863, A136030, A136031, A136032, A136033.

Sequence in context: A049696 A206350 A127405 * A243112 A230127 A059793

Adjacent sequences:  A136031 A136032 A136033 * A136035 A136036 A136037

KEYWORD

nonn,more

AUTHOR

Artur Jasinski, Dec 11 2007

EXTENSIONS

More terms from Julián Aguirre, Feb 04 2013

a(31)-a(39) from Chai Wah Wu, Oct 03 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 13 06:02 EDT 2021. Contains 342935 sequences. (Running on oeis4.)