login
A241155
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=6.
6
1, 1, 1, 1, 1, 1, 6, 6, 6, 6, 6, 6, 11, 11, 11, 11, 11, 16, 11, 16, 16, 16, 21, 16, 21, 16, 21, 26, 21, 26, 21, 26, 26, 26, 31, 26, 31, 31, 31, 31, 31, 36, 36, 36, 36, 36, 36, 36, 41, 41, 41, 41, 41, 46, 41, 46, 46, 46, 51, 46, 51, 46, 51, 56, 51, 56, 51, 56, 56, 56, 61, 56, 61, 61, 61, 61, 61, 66, 66, 66, 66, 66
OFFSET
1,7
LINKS
Joseph Callaghan, John J. Chew III, and Stephen M. Tanny, On the behavior of a family of meta-Fibonacci sequences, SIAM Journal on Discrete Mathematics 18.4 (2005): 794-824. See Eq. (1.7).
MAPLE
#T_s, k(n) from Callaghan et al. Eq. (1.7).
s:=0; k:=6;
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
A241155[n_]:=A241155[n]=If[n<=6, 1, Sum[A241155[n-i-A241155[n-i-1]], {i, 0, 5}]];
Array[A241155, 100] (* Paolo Xausa, Dec 06 2023 *)
CROSSREFS
Callaghan et al. (2005)'s sequences T_{0,k}(n) for k=1 through 7 are A000012, A046699, A046702, A240835, A241154, A241155, A240830.
Sequence in context: A375658 A331944 A103337 * A245399 A243758 A378372
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Apr 16 2014
STATUS
approved