Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136033
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136033 a(n)=smallest number k such that number of prime factors of numbers 2^k-1 A000225 is exactly n (counted with multiplicity). +0
2
2, 4, 6, 16, 12, 18, 24, 40, 54, 36, 102, 110, 60, 72 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A000225, A003260, A016047, A046051, A049479, A088863, A136030, A136031.

Sequence in context: A039791 A127679 A049022 this_sequence A099315 A005179 A037019

Adjacent sequences: A136030 A136031 A136032 this_sequence A136034 A136035 A136036

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research