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 A153867 #23 Dec 23 2024 14:53:42
%S A153867 7,11,29,47,199,521,2207,3571,9349,3010349,54018521,370248451,
%T A153867 6643838879,119218851371,5600748293801,688846502588399,
%U A153867 32361122672259149,412670427844921037470771,258899611203303418721656157249445530046830073044201152332257717521
%N A153867 Primes which are the sum of four consecutive Fibonacci numbers.
%C A153867 1+1+2+3=7, 1+2+3+5=11, 3+5+8+13=29, 5+8+13+21=47, 21+34+55+89=199,...
%H A153867 Vincenzo Librandi, <a href="/A153867/b153867.txt">Table of n, a(n) for n = 1..28</a>
%H A153867 Harvey P. Dale and others, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2014-April/012877.html">A005479 and A153867</a>, SeqFan list, Apr 24 2014.
%F A153867 a(n) = A005479(n+2). - _R. J. Mathar_, Jan 05 2009 [See also link to the SeqFan list. - _M. F. Hasler_, Apr 24 2014]
%t A153867 a=0;b=1;c=1;lst={};Do[d=Fibonacci[n];p=a+b+c+d;If[PrimeQ[p],AppendTo[lst,p]];a=b;b=c;c=d,{n,3,6!}];lst
%t A153867 Select[Total/@Partition[Fibonacci[Range[500]],4,1],PrimeQ] (* _Harvey P. Dale_, Apr 23 2014 *)
%o A153867 (PARI) list(lim)=my(v=List(),a=7,b=11); while(a<=lim, if(isprime(a), listput(v,a)); [a,b]=[b,a+b]); Vec(v) \\ _Charles R Greathouse IV_, Oct 07 2016
%Y A153867 Cf. A001906, A000071, A001605, A153862, A153863, A153865, A153866.
%Y A153867 Primes >3 of A000032 and of A000204.
%K A153867 nonn
%O A153867 1,1
%A A153867 _Vladimir Joseph Stephan Orlovsky_, Jan 03 2009
%E A153867 One additional term (a(19)) from _Harvey P. Dale_, Apr 23 2014