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 A105554 #14 Feb 16 2025 08:32:57 %S A105554 2,3,7,17,37,71,137,251,457,823,1459,2579,4483,7789,13463,23143,39769, %T A105554 67927,115823,196681,333227,563971,951553,1603471,2696653,4528921, %U A105554 7594759,12717701,21275489,35548187,59328121,98921047,164781917 %N A105554 Primes whose indices are the sum of the first n+1 Fibonacci numbers. %C A105554 We avoid testing for existence in the script by beginning with x=1. %C A105554 Sum[i=1 to n+1]F(i) = F(n+3) - 1. See equation (18) of the Weisstein reference. - _Jonathan Vos Post_, May 05 2005 %H A105554 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/FibonacciNumber.html">Fibonacci Number.</a> %F A105554 a(n) = prime(F(n+3) - 1) = A000040(A000045(n+3)-1). - _Jonathan Vos Post_, May 05 2005 %e A105554 a(1) = prime(Fibonacci(0) + Fibonacci(1)) = prime(0+1) = prime(1) = 2. %e A105554 a(3) = prime(Fibonacci(0) + Fibonacci(1) + Fibonacci(2) + Fibonacci(3)) = prime(4) = 7. %t A105554 Prime[Accumulate[Fibonacci[Range[40]]]] (* _Harvey P. Dale_, Aug 14 2023 *) %o A105554 (PARI) g(n) = s=0;for(x=1,n,s+=fibonacci(x);print1(prime(s)",")) %K A105554 easy,nonn %O A105554 1,1 %A A105554 _Cino Hilliard_, May 03 2005 %E A105554 Corrected by _T. D. Noe_, Nov 15 2006