|
Search: id:A128148
|
|
|
| A128148 |
|
a(n) = least k such that 3^k (mod k) is 2^n. |
|
+0
3
|
|
| 2, 2929, 41459, 2352527, 144937, 1055, 1829903, 7316185805, 114491, 3146746271, 5028467, 20299, 69609309001, 129433, 15307006153, 2149705, 66469, 559182815, 18429503, 4529951, 7094711
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(15)-a(16) = {2149705,66469}.
a(21) > 10^12. [From Hagen von Eitzen (math(AT)von-eitzen.de), Aug 01 2009]
|
|
FORMULA
|
a(n) = A078457( 2^n ).
|
|
EXAMPLE
|
a(1) = A128149(3) = 2929.
a(2) = A128150(3) = 41459.
|
|
CROSSREFS
|
Cf. A078457 = least k such that the remainder when 3^k is divided by k is n. Cf. A036236 = least k such that the remainder when 2^k is divided by k is n. Cf. A128149, A128150.
Sequence in context: A109119 A002495 A078457 this_sequence A158348 A158904 A099689
Adjacent sequences: A128145 A128146 A128147 this_sequence A128149 A128150 A128151
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 16 2007
|
|
EXTENSIONS
|
a(7)..a(9) from A078457. Max Alekseyev (maxale(AT)gmail.com), Mar 11 2009
Extended by Max Alekseyev (maxale(AT)gmail.com), Mar 15 2009
a(20) from Hagen von Eitzen (math(AT)von-eitzen.de), Aug 01 2009
|
|
|
Search completed in 0.002 seconds
|
