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 A105756 #26 Feb 16 2025 08:32:57
%S A105756 3,7,8,25,146,169,182,751,812,1507,1591,3157,3752,10651,12740,71804,
%T A105756 155953
%N A105756 Indices of prime Fibonacci 5-step numbers, A001591.
%C A105756 No other n < 44000.
%C A105756 The Noe and Post reference below utilizes a scheme for its indices which differs by 3 from the indices in A001591. - _Robert Price_, Oct 13 2014
%C A105756 The sequence is similar to A248757 which uses the indexing scheme starting at 0 as defined by A001591. - _Robert Price_, Oct 13 2014
%C A105756 a(18) > 2*10^5. - _Robert Price_, Oct 13 2014
%H A105756 Tony D. Noe and Jonathan Vos Post, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL8/Noe/noe5.html">Primes in Fibonacci n-step and Lucas n-step Sequences,</a> J. of Integer Sequences, Vol. 8 (2005), Article 05.4.4
%H A105756 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Fibonaccin-StepNumber.html">Fibonacci n-Step Number</a>
%t A105756 a = {1, 0, 0, 0, 0}; lst = {}; Do[s = Plus @@ a; a = RotateLeft[a];
%t A105756 a[[-1]] = s; If[PrimeQ[s], AppendTo[lst, n]], {n, 44000}]; lst
%t A105756 Flatten[Position[LinearRecurrence[{1,1,1,1,1},{0,0,0,0,1},13000],_?PrimeQ]]-4 (* _Harvey P. Dale_, Mar 06 2023 *)
%Y A105756 Cf. A105757 (prime Fibonacci 5-step numbers).
%K A105756 nonn
%O A105756 1,1
%A A105756 _T. D. Noe_, Apr 22 2005
%E A105756 Restored original sequence after reconsideration and added a(16)-a(17) by _Robert Price_, Oct 13 2014