Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086564
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086564 Smallest k such that 10^k + 1 has n distinct prime divisors. +0
1
0, 4, 3, 11, 9, 36, 15, 33, 39, 69, 63, 45 (list; graph; listen)
OFFSET

1,2

COMMENT

All subsequent terms are > 71. - David Wasserman (wasserma(AT)spawar.navy.mil), Mar 28 2005

FORMULA

a(n) = Log to the base 10 of {A086563(n)-1}.

EXAMPLE

a(5) = 9 = Log to the base 10 {1000000001 - 1}.

CROSSREFS

Cf. A086563.

Sequence in context: A100492 A072183 A005013 this_sequence A080777 A001166 A065337

Adjacent sequences: A086561 A086562 A086563 this_sequence A086565 A086566 A086567

KEYWORD

more,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 31 2003

EXTENSIONS

More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Sep 22 2003

a(10)-a(12) from David Wasserman (wasserma(AT)spawar.navy.mil), Mar 28 2005

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 November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research