The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Robert Israel, Table of n, a(n) for n = 1..4782 FORMULA a(n) = A000079(n) - A057861(n)*A000045(n) MAPLE seq(2 &^n mod combinat:-fibonacci(n), n=1..100); # Robert Israel, Jul 13 2018 MATHEMATICA Table[Mod[2^n, Fibonacci[n]], {n, 1, 80}] (* Vladimir Joseph Stephan Orlovsky, Apr 03 2011*) 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 (PARI) a(n)=2^n%fibonacci(n) \\ Charles R Greathouse IV, Jun 19 2017 (GAP) List([1..42], n->PowerMod(2, n, Fibonacci(n))); # Muniru A Asiru, Jul 13 2018 CROSSREFS Cf. A000045, A000079. Sequence in context: A342287 A230696 A138542 * A265512 A102869 A274177 Adjacent sequences:  A057859 A057860 A057861 * A057863 A057864 A057865 KEYWORD nonn AUTHOR Henry Bottomley, Sep 08 2000 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 27 21:12 EDT 2021. Contains 347698 sequences. (Running on oeis4.)