login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113823 Tribonacci analog of A055502. 3

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 07:35 EDT 2024. Contains 371782 sequences. (Running on oeis4.)