cp's OEIS Frontend

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.

A126092 a(1)=2, a(2)=3, a(3)=5; a(n) = largest prime < a(n-1)+a(n-2)+a(n-3).

This page as a plain text file.
%I A126092 #7 Jun 09 2018 10:45:03
%S A126092 2,3,5,7,13,23,41,73,131,241,443,811,1493,2741,5039,9257,17033,31327,
%T A126092 57601,105953,194869,358417,659237,1212521,2230159,4101907,7544573,
%U A126092 13876601,25523011,46944179,86343787,158810947,292098907,537253631
%N A126092 a(1)=2, a(2)=3, a(3)=5; a(n) = largest prime < a(n-1)+a(n-2)+a(n-3).
%H A126092 Robert Israel, <a href="/A126092/b126092.txt">Table of n, a(n) for n = 1..3775</a>
%p A126092 f:= proc(n) option remember; prevprime(procname(n-1)+procname(n-2)+procname(n-3)) end proc:
%p A126092 f(1):= 2: f(2):= 3: f(3):= 5:
%p A126092 map(f, [$1..100]); # _Robert Israel_, Mar 12 2018
%t A126092 nxt[{a_,b_,c_}]:={b,c,NextPrime[a+b+c,-1]}; NestList[nxt,{2,3,5},40][[All,1]] (* _Harvey P. Dale_, Jun 09 2018 *)
%Y A126092 Cf. A055501.
%K A126092 nonn
%O A126092 1,1
%A A126092 _Zak Seidov_, Mar 03 2007