|
Search: id:A136034
|
|
|
| A136034 |
|
a(n) = smallest number k such that number of distinct prime factors of numbers 2^k-1 A000225 is exactly n. |
|
+0
1
|
|
| 2, 4, 8, 12, 20, 24, 40, 36, 48, 88, 60, 72, 150, 132, 120
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
First occurrence of n in A046800
|
|
CROSSREFS
|
Cf. A000225, A003260, A016047, A046051, A046800, A049479, A088863, A136030, A136031, A136032, A136033.
Sequence in context: A110571 A049696 A127405 this_sequence A059793 A118029 A049322
Adjacent sequences: A136031 A136032 A136033 this_sequence A136035 A136036 A136037
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Artur Jasinski (grafix(AT)csl.pl), Dec 11 2007
|
|
|
Search completed in 0.002 seconds
|
