|
Search: id:A147884
|
|
|
| A147884 |
|
a(n) is the smallest positive integer k such that the last n digits of 2^k are 1 or 2. |
|
+0
1
|
|
| 1, 9, 89, 89, 589, 3089, 3089, 3089, 315589, 315589, 8128089, 164378089, 945628089, 1922190589, 11687815589, 109344065589, 231414378089, 1452117503089, 4503875315589, 65539031565589, 141832976878089, 1667711883128089
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(n) = the smallest degree k such that 2^k == A053312(n) (mod 5^n)
|
|
PROGRAM
|
(PARI) { m=2; for(n=1, 50, print1(znlog(m, Mod(2, 5^n)), ", "); m+=10^n; if(m%(2^(n+1)), m+=10^n); ) }
|
|
CROSSREFS
|
Cf. A053312
Sequence in context: A152266 A084022 A084015 this_sequence A055410 A111918 A064616
Adjacent sequences: A147881 A147882 A147883 this_sequence A147885 A147886 A147887
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Max Alekseyev (maxale(AT)gmail.com), Nov 17 2008
|
|
|
Search completed in 0.002 seconds
|
