Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Sep 24 2023 05:47:09
%S 0,2,3,7,13,29,53,97,181,337,617,1151,2111,3881,7151,13147,24181,
%T 44483,81817,150497,276817,509137,936469,1722431,3168097,5827001,
%U 10717561,19712669,36257237,66687469,122657377,225602099,414946951,763206467,1403755531,2581909003
%N Tribonacci analog of A055502.
%C This is to the tribonacci sequence as A055502 is to the Fibonacci sequence (i.e. least prime greater than the sum of the previous 2 terms in A055502, least prime greater than the sum of the previous 3 terms in this sequence).
%C The first 9 positive terms are also elements of A089189 but that coincidence breaks down as a(10) = 617 is a prime p, but p-1 = 616 = 2^3 * 7 * 11 is not cubefree.
%H Amiram Eldar, <a href="/A113823/b113823.txt">Table of n, a(n) for n = 0..1000</a>
%F a(0) = 0, a(1) = 2, for n>2: a(n) = smallest prime > a(n-1)+a(n-2)+a(n-3).
%t a[0] = 0; a[1] = 2; a[2] = 3; a[n_] := a[n] = NextPrime[a[n-1] + a[n-2] + a[n-3]]; Array[a, 40, 0] (* _Amiram Eldar_, Sep 24 2023 *)
%Y Cf. A055502, A089189.
%K easy,nonn
%O 0,2
%A _Jonathan Vos Post_, Jan 23 2006
%E More terms from _Amiram Eldar_, Sep 24 2023