|
| |
|
|
A128162
|
|
3^n modulo Fibonacci(n).
|
|
2
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,5
|
|
|
COMMENTS
| 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}]
|
|
|
PROG
| (Other) sage: [power_mod(3, n, fibonacci(n))for n in xrange(1, 41)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 28 2009]
|
|
|
CROSSREFS
| Cf. A128163, A128161, A057862 = 2^n modulo Fibonacci(n).
Sequence in context: A146436 A058842 A155734 * A067329 A170860 A170845
Adjacent sequences: A128159 A128160 A128161 * A128163 A128164 A128165
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 19 2007
|
| |
|
|
