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.

A023177 Numbers k such that Fibonacci(k) == 8 (mod k).

Original entry on oeis.org

1, 3, 6, 54, 174, 246, 366, 534, 606, 654, 894, 966, 1086, 1374, 1446, 1614, 1686, 2046, 2094, 2214, 2334, 2406, 2454, 2526, 2694, 2766, 3054, 3126, 3246, 3414, 3606, 3846, 3966, 4206, 4254, 4566, 4614, 4854, 4926, 4974, 5286, 5382, 5406, 5574, 5646, 6054
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Maple
    filter:= n -> combinat:-fibonacci(n) - 8 mod n = 0:
    select(filter, [$1..10^4]); # Robert Israel, Mar 05 2025
  • Mathematica
    Select[Range[6100], Mod[Fibonacci[#] - 8, #]==0&]  (* Harvey P. Dale, Sep 21 2021 *)

Formula

A002708(a(n)) = 8 (for n >= 4). - Robert Israel, Mar 05 2025

Extensions

Definition clarified by N. J. A. Sloane, Sep 21 2021