login

Revision History for A296690

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(1) = a(2) = a(3) = 2, a(4) = 4, a(5) = a(6) = 5; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 6.
(history; published version)
#15 by N. J. A. Sloane at Mon Dec 18 22:49:51 EST 2017
STATUS

proposed

approved

#14 by Altug Alkan at Mon Dec 18 22:34:49 EST 2017
STATUS

editing

proposed

#13 by Altug Alkan at Mon Dec 18 22:34:14 EST 2017
KEYWORD

nonn,look,new

#12 by Altug Alkan at Mon Dec 18 22:33:30 EST 2017
LINKS

Altug Alkan, <a href="/A296690/b296690.txt">Table of n, a(n) for n = 1..10000</a>

STATUS

approved

editing

#11 by Susanna Cuyler at Mon Dec 18 19:42:30 EST 2017
STATUS

proposed

approved

#10 by Antti Karttunen at Mon Dec 18 19:37:32 EST 2017
STATUS

editing

proposed

#9 by Antti Karttunen at Mon Dec 18 19:37:08 EST 2017
PROG

(Scheme) (definec (A296690 n) (cond ((<= n 3) 2) ((<= n 5) n) ((= n 6) 5) (else (+ (A296690 (- n (A296690 (- n 1)))) (A296690 (- n (A296690 (- n 2)))) (A296690 (- n (A296690 (- n 3)))))))) ;; Antti Karttunen, Dec 18 2017

STATUS

proposed

editing

#8 by Altug Alkan at Mon Dec 18 16:58:50 EST 2017
STATUS

editing

proposed

#7 by Altug Alkan at Mon Dec 18 16:47:08 EST 2017
#6 by Altug Alkan at Mon Dec 18 16:45:38 EST 2017
MATHEMATICA

a[n_] := a[n] = If[n<7, {2, 2, 2, 4, 5, 5}[[n]], a[n - a[n-1]] + a[n - a[n-2]] + a[n - a[n-3]]]; Array[a, 83100] (* after Giovanni Resta at A296440 *)