login

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”).

A308936
a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)), with a(n) = ceiling(4*n/5) for n <= 9.
1
1, 2, 3, 4, 4, 5, 6, 7, 8, 9, 9, 10, 11, 11, 12, 12, 13, 14, 15, 15, 16, 17, 18, 18, 19, 20, 21, 21, 22, 23, 24, 24, 25, 26, 26, 27, 27, 28, 29, 30, 30, 31, 32, 32, 33, 33, 34, 35, 35, 36, 36, 37, 38, 39, 39, 40, 41, 42, 42, 43, 44, 44, 45, 45, 46, 47, 48, 48, 49, 50, 51, 51, 52, 53, 53, 54, 54, 55, 56, 57, 57
OFFSET
1,2
COMMENTS
Similar to A278055 but with different starting values.
LINKS
MAPLE
a:= proc(n) option remember; procname(n-procname(n-1))+procname(n-procname(n-2))+procname(n-procname(n-3)) end proc:
for n from 1 to 9 do a(n):= ceil(4*n/5) od:
map(a, [$1..100]); # Robert Israel, Jul 28 2024
PROG
(PARI) q=vector(100); for(n=1, 9, q[n]=ceil(4*n/5)); for(n=10, #q, q[n]=q[n-q[n-1]]+q[n-q[n-2]]+q[n-q[n-3]]); q
CROSSREFS
Cf. A278055.
Sequence in context: A366870 A171974 A232748 * A187737 A109401 A307294
KEYWORD
nonn
AUTHOR
Altug Alkan, Aug 02 2019
STATUS
approved