This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A262348 a(n) = A000215(n) mod A000045(n). 0
 0, 0, 1, 2, 2, 1, 10, 17, 19, 17, 5, 17, 75, 17, 257, 983, 987, 1481, 4178, 4652, 7433, 3488, 10665, 19169, 51372, 538, 257, 65537, 422030, 17, 111134, 430622, 592107, 1036631, 4104877, 11311649, 4963932, 23430341, 16834037, 65537, 67016878, 53547017, 316617399 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Eric Weisstein's World of Mathematics, Fermat Number Eric Weisstein's World of Mathematics, Fibonacci Number MATHEMATICA f[n_] := Mod[ PowerMod[2, 2^n, Fibonacci[n]] + 1, Fibonacci[n]]; Array[f, 43] (* Robert G. Wilson v, Sep 18 2015 *) PROG (MAGMA) [(2^(2^n) + 1) mod(Fibonacci(n)): n in [1..29]]; // Vincenzo Librandi, Sep 19 2015 (PARI) a(n) = my (fn = fibonacci(n)); lift(Mod(Mod(2, fn)^(2^n) + 1, fn)); \\ Michel Marcus, Sep 19 2015 CROSSREFS Cf. A000045, A000215, A182213, A246846. Sequence in context: A105620 A182002 A184251 * A307093 A327087 A088876 Adjacent sequences:  A262345 A262346 A262347 * A262349 A262350 A262351 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Sep 18 2015 EXTENSIONS More terms from Robert G. Wilson v, Sep 18 2015 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 August 21 23:04 EDT 2019. Contains 326169 sequences. (Running on oeis4.)