cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A262348 a(n) = A000215(n) mod A000045(n).

Original entry on oeis.org

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
Offset: 1

Views

Author

Ilya Gutkovskiy, Sep 18 2015

Keywords

Crossrefs

Programs

  • Magma
    [(2^(2^n) + 1) mod(Fibonacci(n)): n in [1..29]]; // Vincenzo Librandi, Sep 19 2015
    
  • Mathematica
    f[n_] := Mod[ PowerMod[2, 2^n, Fibonacci[n]] + 1, Fibonacci[n]]; Array[f, 43] (* Robert G. Wilson v, Sep 18 2015 *)
  • PARI
    a(n) = my (fn = fibonacci(n)); lift(Mod(Mod(2, fn)^(2^n) + 1, fn)); \\ Michel Marcus, Sep 19 2015

Extensions

More terms from Robert G. Wilson v, Sep 18 2015