|
Search: id:A128162
|
|
|
| A128162 |
|
3^n modulo Fibonacci(n). |
|
+0
3
|
|
| 0, 0, 1, 0, 3, 1, 3, 9, 31, 34, 37, 81, 137, 347, 487, 690, 355, 1369, 2001, 1926, 5331, 1369, 4823, 8289, 74043, 77951, 188571, 284781, 490766, 166409, 1333373, 1803615, 1516839, 914943, 3619092, 3987873, 17604245, 8506938, 57277423, 24741861
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
Numbers n such that a(n) is prime are listed in A128163(n) = {5,7,9,11,13,14,15,26,30,53,82,...}. Corresponding primes in a(n) are {3,3,31,37,137,347,487,77951,166409,13506083561,...}.
|
|
MATHEMATICA
|
Table[PowerMod[3, n, Fibonacci[n]], {n, 1, 100}]
|
|
CROSSREFS
|
Cf. A128163, A128161, A057862 = 2^n modulo Fibonacci(n).
Sequence in context: A088442 A037095 A058842 this_sequence A067329 A025238 A126970
Adjacent sequences: A128159 A128160 A128161 this_sequence A128163 A128164 A128165
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 19 2007
|
|
|
Search completed in 0.002 seconds
|
