|
|
A046700
|
|
a(1) = a(2) = a(3) = 1, a(n) = a(n - a(n-1)) + a(n - a(n-3)) for 3 < n < 165.
|
|
6
|
|
|
1, 1, 1, 2, 3, 4, 4, 5, 5, 7, 6, 8, 7, 9, 8, 10, 9, 12, 9, 12, 10, 15, 11, 16, 12, 17, 13, 18, 14, 19, 15, 21, 17, 18, 18, 21, 19, 21, 24, 20, 22, 24, 20, 31, 19, 30, 19, 28, 19, 30, 21, 32, 21, 34, 21, 36, 21, 38, 21, 48, 18, 53, 15, 49, 18, 49, 24, 61, 17, 51, 19, 42
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
REFERENCES
|
Sequence proposed by Reg Allenby.
Undefined past a(164), since a(164) = 202.
|
|
LINKS
|
|
|
MAPLE
|
V := proc(n) option remember; if n<=3 then 1 else if n > V(n-1) and n > V(n-3) then RETURN(V(n-V(n-1))+V(n-V(n-3))); else ERROR(" died at n= ", n); fi; fi; end;
|
|
MATHEMATICA
|
a[1] = a[2] = a[3] = 1; a[n_] := a[n] = a[n - a[n - 1]] + a[n - a[n - 3]]; Array[a, 72] (* Jean-François Alcover, Dec 12 2016 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|