[go: up one dir, main page]

login
a(1) = 1; for n > 1, a(n) = a(n-1) - A000005(n) if a(n) strictly positive, else a(n) = a(n-1) + A000005(n).
0

%I #10 Jul 06 2023 22:05:59

%S 1,3,1,4,2,6,4,8,5,1,3,9,7,3,7,2,4,10,8,2,6,2,4,12,9,5,1,7,5,13,11,5,

%T 1,5,1,10,8,4,8,16,14,6,4,10,4,8,6,16,13,7,3,9,7,15,11,3,7,3,1,13,11,

%U 7,1,8,4,12,10,4,8,16,14,2,4,8,2,8,4,12,10,20,15,11,9,21

%N a(1) = 1; for n > 1, a(n) = a(n-1) - A000005(n) if a(n) strictly positive, else a(n) = a(n-1) + A000005(n).

%C Variation on Recamán's sequence A005132.

%e a(1) = 1

%e a(2) = 1 + A000005(2) = 3

%t a[1] = 1; a[n_] := a[n] = Module[{d = DivisorSigma[0, n]}, If[a[n - 1] > d, a[n - 1] - d, a[n - 1] + d]]; Array[a, 100] (* _Amiram Eldar_, Jun 13 2023 *)

%Y Cf. A000005, A005132, A008343, A008344, A046901, A063733, A336760.

%K nonn

%O 1,2

%A _Ctibor O. Zizka_, Jun 13 2023