|
Search: id:A128163
|
|
|
| A128163 |
|
a(n) = numbers n such that 3^n modulo Fibonacci(n) is prime, or A128162(n) is prime. |
|
+0
3
|
|
| 5, 7, 9, 11, 13, 14, 15, 26, 30, 53, 66, 82, 155, 189, 225, 261, 625, 870, 1071, 7655, 8191, 8883, 9226, 12246, 70274, 71595
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Corresponding primes in A128162(n) are {3,3,31,37,137,347,487,77951,166409,13506083561,...}.
|
|
MATHEMATICA
|
Do[f=PowerMod[3, n, Fibonacci[n]]; If[PrimeQ[f], Print[{n, f}]], {n, 1, 1071}]
|
|
CROSSREFS
|
Cf. A128162 = 3^n modulo Fibonacci(n). Cf. A128161, A057862 = 2^n modulo Fibonacci(n).
Sequence in context: A165513 A002342 A080353 this_sequence A106505 A097985 A099047
Adjacent sequences: A128160 A128161 A128162 this_sequence A128164 A128165 A128166
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 19 2007
|
|
EXTENSIONS
|
Corrected and extended by Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 10 2007
a(25)-a(26) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Sep 03 2008
|
|
|
Search completed in 0.002 seconds
|
