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 A270951 #24 Sep 11 2022 21:40:01 %S A270951 1,7,17,23,31,41,47,71,73,79,89,97,103,113,127,137,151,167,169,191, %T A270951 193,199,223,233,239,241,257,263,271,281,311,313,337,353,359,367,383, %U A270951 385,401,409,431,433,439,449,457,463,479,487,503,521,569,577,593,599,601,607,617,631,641,647,673,719,727,743 %N A270951 Numbers k such that k | A000129(k-1). %C A270951 Although A246692 and this sequence have similar names, note that this sequence generates prime numbers most of the time. %C A270951 Composite terms of this sequence are A351337. %H A270951 Amiram Eldar, <a href="/A270951/b270951.txt">Table of n, a(n) for n = 1..10000</a> %e A270951 7 is a term because A000129(6) = 70 is divisible by 7. %t A270951 Select[Range[1000], Divisible[Fibonacci[#-1, 2], #]&] (* _Jean-François Alcover_, Jun 06 2017 *) %o A270951 (PARI) a000129(n) = ([2, 1; 1, 0]^n)[2, 1]; %o A270951 for(n=1, 1e3, if(Mod(a000129(n-1), n) == 0, print1(n, ", "))); %o A270951 (PARI) is(n)=(Mod([2,1;1,0],n)^(n-1))[2,1]==0 \\ _Charles R Greathouse IV_, Sep 11 2022 %Y A270951 Cf. A000129, A001132, A246692, A270834, A351337 (composite terms). %K A270951 nonn,easy %O A270951 1,2 %A A270951 _Altug Alkan_, Mar 26 2016