|
| |
|
|
A057862
|
|
2^n modulo Fibonacci(n).
|
|
4
|
|
|
|
0, 0, 0, 1, 2, 0, 11, 4, 2, 34, 1, 64, 37, 173, 438, 394, 118, 1160, 1663, 1, 6466, 14508, 20764, 38368, 18257, 99928, 64234, 202972, 15836, 410224, 184593, 1520257, 538006, 2773540, 5886173, 9996832, 5132559, 9902536, 21703576, 33466456
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,5
|
|
|
LINKS
|
Table of n, a(n) for n=1..40.
|
|
|
FORMULA
|
a(n) = A000079(n) - A057861(n)*A000045(n)
|
|
|
MATHEMATICA
|
Table[Mod[2^n, Fibonacci[n]], {n, 1, 80}] (*From Vladimir Joseph Stephan Orlovsky, Apr 03 2011*)
|
|
|
PROG
|
(Sage) [power_mod(2, n, fibonacci(n))for n in xrange(1, 41)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 28 2009]
|
|
|
CROSSREFS
|
Sequence in context: A167387 A189423 A138542 * A102869 A075533 A053814
Adjacent sequences: A057859 A057860 A057861 * A057863 A057864 A057865
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Henry Bottomley, Sep 08 2000
|
|
|
STATUS
|
approved
|
| |
|
|
