Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Recursive sequence: a(n) = 1+mod(abs(n-2+a(n-2)),n) + mod(abs(n-1+a(n-1)),n-1), a(0) = 1, a(1) = 1, a(2) = 1, a(3)=1, a(4)=2.
1

%I #19 Mar 30 2012 17:34:43

%S 1,1,1,1,2,7,3,9,4,12,6,17,11,14,11,24,19,9,27,17,23,19,41,37,30,17,

%T 20,36,28,6,33,8,40,15,20,34,53,50,27,37,63,59,38,53,47,10,56,19,26,

%U 44,69,62,27,35,61,41,45,85

%N Recursive sequence: a(n) = 1+mod(abs(n-2+a(n-2)),n) + mod(abs(n-1+a(n-1)),n-1), a(0) = 1, a(1) = 1, a(2) = 1, a(3)=1, a(4)=2.

%H Paolo P. Lava, <a href="/A209121/b209121.txt">Table of n, a(n) for n = 0..10000</a>

%t a[0] = 1; a[1] = 1; a[2] = 1; a[3] = 1; a[4] = 2;a[n_] := a[n] = 1 + Mod[Abs[n - 2 + a[n - 2]], n] + Mod[Abs[n - 1 + a[n - 1]], n - 1]; Table[a[n], {n, 0, 100}]

%Y Cf. A072222.

%K nonn

%O 0,5

%A _Roger L. Bagula_, Mar 05 2012