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.
%I A159259 #22 Apr 03 2023 10:36:11 %S A159259 27,37,97,577,687,727,777,807,1297,1707,1917,2067,2487,2787,2977,3027, %T A159259 3037,3067,3277,3367,3417,3507,3837,4047,4257,4377,4447,4567,4717, %U A159259 5137,5557,5637,5677,5917,5967,6057,6187,6327,7077,7087,7357,7407,7507,7597 %N A159259 Positive numbers n such that 8*n^2-2*n-1 divides Fibonacci(n). %C A159259 The prime numbers of this sequence are in A159231. %H A159259 Arkadiusz Wesolowski, <a href="/A159259/b159259.txt">Table of n, a(n) for n = 1..1000</a> %H A159259 Chris Caldwell, The Prime Glossary, <a href="https://t5k.org/glossary/xpage/FibonacciNumber.html">Fibonacci number</a> %t A159259 Select[Range[7597], Mod[Fibonacci[#], 8*#^2 - 2*# - 1] == 0 &] (* _Arkadiusz Wesolowski_, Dec 12 2011 *) %o A159259 (Magma) [n : n in [1..7597] | IsZero(Fibonacci(n) mod (8*n^2-2*n-1))] // _Arkadiusz Wesolowski_, Nov 09 2013 %o A159259 (PARI) for(n=1, 7597, if(Mod(fibonacci(n), 8*n^2-2*n-1)==0, print1(n, ", "))); \\ _Arkadiusz Wesolowski_, Nov 09 2013 %Y A159259 Cf. A000045, A023172, A159234, A159231, A181890. %K A159259 nonn %O A159259 1,1 %A A159259 _Arkadiusz Wesolowski_, Apr 07 2009