|
|
A240835
|
|
a(n)=1 for n <= s+k; thereafter a(n) = Sum_{i=0..k-1} a(n-i-s-a(n-i-1)) where s=0, k=4.
|
|
6
|
|
|
1, 1, 1, 1, 4, 4, 4, 4, 7, 7, 7, 10, 7, 10, 13, 10, 13, 13, 13, 16, 16, 16, 16, 16, 19, 19, 19, 22, 19, 22, 25, 22, 25, 25, 25, 28, 28, 28, 28, 31, 31, 31, 34, 31, 34, 37, 34, 37, 37, 34, 40, 40, 37, 43, 40, 40, 46, 43, 43, 46, 46, 46, 49, 49, 46, 52, 52, 49, 55, 52, 52, 58, 55, 55, 58, 55, 58, 61, 58, 61, 61, 61
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
LINKS
|
|
|
MAPLE
|
#T_s, k(n) from Callaghan et al. Eq. (1.7).
s:=0; k:=4;
a:=proc(n) option remember; global s, k;
if n <= s+k then 1
else
add(a(n-i-s-a(n-i-1)), i=0..k-1);
fi; end;
t1:=[seq(a(n), n=1..100)];
|
|
MATHEMATICA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|