login
A023176
Numbers k such that Fibonacci(k) == 5 (mod k).
1
1, 2, 3, 5, 8, 10, 20, 21, 32, 55, 80, 95, 104, 145, 155, 165, 205, 247, 295, 305, 320, 355, 395, 437, 445, 505, 545, 605, 655, 667, 695, 745, 755, 895, 905, 955, 987, 995, 1055, 1145, 1195, 1205, 1255, 1345, 1355, 1405, 1435, 1555, 1615, 1655, 1705, 1745, 1795
OFFSET
1,2
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
PROG
(PARI) is(n)=((Mod([1, 1; 1, 0], n))^n)[1, 2]==5 \\ Charles R Greathouse IV, May 29 2013
CROSSREFS
Cf. A000045.
Sequence in context: A122633 A004694 A309527 * A063178 A280205 A276731
KEYWORD
nonn
STATUS
approved