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 A248757 #11 Feb 16 2025 08:33:23
%S A248757 6,10,11,28,149,172,185,754,815,1510,1594,3160,3755,10654,12743,71807,
%T A248757 155957
%N A248757 Indices of prime Fibonacci 5-step numbers, A001591.
%C A248757 This sequence is similar to A105756 but uses the indexing scheme defined by A001591 whose indices start with 0.
%C A248757 a(18) > 2*10^5.
%H A248757 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 A248757 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Fibonaccin-StepNumber.html">Fibonacci n-Step Number</a>
%F A248757 a(n) = A105756 (n) + 3.
%t A248757 a = {0, 0, 0, 0, 1}; For[n = 5, n ≤ 1000, n++, sum = Plus @@ a;
%t A248757 If[PrimeQ[sum], Print[n]]; a = RotateLeft[a]; a[[5]] = sum]
%Y A248757 Cf. A001591, A105756.
%K A248757 nonn,more
%O A248757 1,1
%A A248757 _Robert Price_, Oct 13 2014