login
This site is supported by donations to The OEIS 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 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

First occurrence of n in A046800

CROSSREFS

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

Sequence in context: A049696 A206350 A127405 * A059793 A118029 A049322

Adjacent sequences:  A136031 A136032 A136033 * A136035 A136036 A136037

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Dec 11 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.