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 A092836 #17 Feb 16 2025 08:32:53
%S A092836 2,7,13,149,19341322569415713958901,15762679542071167858843489,
%T A092836 145082467753351661438130501937754420584096000083183992629
%N A092836 Prime tribonacci numbers.
%C A092836 The next term has 212 digits and is too large to fit. - _Harvey P. Dale_, Oct 08 2017
%C A092836 These primes are A000073(k) at k = 4, 6, 7, 11, 87, 98, 215, 802, 4202, ... The indices in A092835 are off by one. - _R. J. Mathar_, Dec 14 2011
%H A092836 Harry J. Smith, <a href="/A092836/b092836.txt">Table of n, a(n) for n = 1..8</a>
%H A092836 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 A092836 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TribonacciNumber.html">Tribonacci Number</a>
%t A092836 Select[LinearRecurrence[{1,1,1},{0,0,1},1000],PrimeQ] (* _Harvey P. Dale_, Oct 08 2017 *)
%o A092836 (PARI) t(m)= { if (m==0, return(a1)); if (m==1, return(a2)); if (m==2, return(a3)); r = a1 + a2 + a3; a1=a2; a2=a3; a3=r; return(r); } { a1=0; a2=1; a3=1; n=0; for (m=0, 1000, a=t(m); if (isprime(a), write("b092836.txt", n++, " ", a))); } \\ _Harry J. Smith_, Jun 21 2009
%Y A092836 Cf. A000073, A092835, A056816.
%K A092836 nonn
%O A092836 1,1
%A A092836 _Eric W. Weisstein_, Mar 06 2004