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.

A023176 Numbers k such that Fibonacci(k) == 5 (mod k).

This page as a plain text file.
%I A023176 #12 Jul 24 2021 08:40:34
%S A023176 1,2,3,5,8,10,20,21,32,55,80,95,104,145,155,165,205,247,295,305,320,
%T A023176 355,395,437,445,505,545,605,655,667,695,745,755,895,905,955,987,995,
%U A023176 1055,1145,1195,1205,1255,1345,1355,1405,1435,1555,1615,1655,1705,1745,1795
%N A023176 Numbers k such that Fibonacci(k) == 5 (mod k).
%H A023176 Charles R Greathouse IV, <a href="/A023176/b023176.txt">Table of n, a(n) for n = 1..10000</a>
%o A023176 (PARI) is(n)=((Mod([1,1;1,0],n))^n)[1,2]==5 \\ _Charles R Greathouse IV_, May 29 2013
%Y A023176 Cf. A000045.
%K A023176 nonn
%O A023176 1,2
%A A023176 _David W. Wilson_