|
|
A057862
|
|
a(n) = 2^n mod Fibonacci(n).
|
|
6
|
|
|
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
|
|
|
FORMULA
|
|
|
MAPLE
|
seq(2 &^n mod combinat:-fibonacci(n), n=1..100); # Robert Israel, Jul 13 2018
|
|
MATHEMATICA
|
Table[PowerMod[2, n, Fibonacci[n]], {n, 40}] (* Harvey P. Dale, Dec 30 2018 *)
|
|
PROG
|
(Sage) [power_mod(2, n, fibonacci(n))for n in range(1, 41)] # Zerinvary Lajos, Nov 28 2009
(GAP) List([1..42], n->PowerMod(2, n, Fibonacci(n))); # Muniru A Asiru, Jul 13 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|