|
%I #9 Dec 18 2022 08:05:13
%S 0,1,3,3,2,6,1,3,8,3,5,2,8,8,4,4,9,8,6,11,6,7,5,7,10,7,11,9,12,7,8,6,
%T 10,9,7,14,6,9,6,12,14,11,6,9,15,9,12,15,10,15,13,5,17,7,15,14,8,18,
%U 16,10,12,18,16,15,15,14,20,15,6,18,17,17,17,7,16,9,15,15,19,13,16,13,21,17
%N Let fw[n_] := Mod[n, 4], fb[n_] := Mod[n, 3]; a(n) = a(n-a(n-1))+1+fw[n-a(n-2)]-fb[n-a(n-1)].
%t fw[n_] := Mod[n, 4];
%t fb[n_] := Mod[n, 3];
%t a[0] = 0; a[1] = 1;
%t a[n_Integer?Positive] := a[n] = a[n - a[n - 1]] + 1 + fw[n - a[n - 2]] - fb[n - a[n - 1]];
%t Table[a[n], {n, 0, 80}]
%K nonn,easy,less,uned
%O 0,3
%A _Roger L. Bagula_, Sep 20 2005
|
