Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104146
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104146 Smallest k>0 such that n*10^k + k is prime. +0
2
1, 3, 1, 1, 3, 1, 1, 147, 17, 1, 3, 7, 1, 297, 1 (list; graph; listen)
OFFSET

1,2

COMMENT

(a(n) mod 10) in {1,3,7,9}.

a(16), if it exists, is greater than 20000. - Ryan Propper (rpropper(AT)stanford.edu), Jul 21 2006

a(16), if it exists, is greater than 42000. - Ryan Propper (rpropper(AT)stanford.edu), Sep 25 2006

CROSSREFS

a(floor(A030430(n)/10)) = 1.

Adjacent sequences: A104143 A104144 A104145 this_sequence A104147 A104148 A104149

Sequence in context: A091840 A083985 A109848 this_sequence A133705 A046111 A131779

KEYWORD

nonn,more

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 07 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 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research