|
Search: id:A114780
|
|
|
| A114780 |
|
Least multiple of 2n-1 ending in prime(n). If prime(n) has k digits then a(n) == prime(n) (mod 10^k),0 if no such number exists. a(10r+5) =0. |
|
+0
3
|
|
| 2, 3, 5, 7, 711, 913, 117, 0, 323, 1729, 231, 437, 0, 243, 1247, 1953, 759, 0, 3367, 3471, 2173, 2279, 0, 4089, 2597, 28101, 45103, 0, 2109, 18113, 43127, 40131, 0, 1139, 22149, 34151, 37157, 0, 13167, 62173, 37179, 17181, 0, 38193, 33197, 17199, 86211
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(5) =711, ending in 11 =prime(n) and 711 ==0 (mod 9, the fifth odd number).
|
|
CROSSREFS
|
Cf. A114781.
Sequence in context: A046477 A145843 A090720 this_sequence A134811 A046479 A109208
Adjacent sequences: A114777 A114778 A114779 this_sequence A114781 A114782 A114783
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 17 2005
|
|
EXTENSIONS
|
More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 05 2006
|
|
|
Search completed in 0.002 seconds
|
