|
Search: id:A128161
|
|
|
| A128161 |
|
a(n) = numbers n such that 2^n modulo Fibonacci(n) is prime, or A057862(n) is prime. |
|
+0
3
|
|
| 5, 7, 9, 13, 14, 19, 25, 88, 100, 113, 130, 440, 503, 2800, 3203, 3346, 4357, 6496, 8822, 16316, 20039, 22381, 30481, 33779
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Corresponding primes in A057862(n) are {2,11,2,37,173,1663,18257,447876604131364627,55437674149894825801,...}.
|
|
MATHEMATICA
|
Do[f=PowerMod[2, n, Fibonacci[n]]; If[PrimeQ[f], Print[{n, f}]], {n, 1, 503}]
|
|
CROSSREFS
|
Cf. A057862 = 2^n modulo Fibonacci(n). Cf. A128162, A128163.
Sequence in context: A005427 A116024 A115913 this_sequence A141106 A047478 A048974
Adjacent sequences: A128158 A128159 A128160 this_sequence A128162 A128163 A128164
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 19 2007
|
|
EXTENSIONS
|
a(14)-a(19) from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 10 2007
More terms from Ryan Propper (rpropper(AT)cs.stanford.edu), Jan 11 2008
|
|
|
Search completed in 0.002 seconds
|
