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)
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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research