The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A362896 a(0)=2. For n>0, let d = n-th digit in the sequence thus far. a(n) = a(n-1) + d if d is even. Otherwise, a(n) = a(n-1) - d. 1

%I #25 May 17 2023 20:45:19

%S 2,4,8,16,15,21,20,15,17,16,18,18,17,12,11,4,3,9,8,16,15,23,22,15,14,

%T 16,15,14,18,15,6,14,13,19,18,13,15,12,14,16,15,10,9,13,12,18,17,12,

%U 11,15,14,22,21,16,22,21,25,24,21,20,11,10,18,17,14,13,8,7

%N a(0)=2. For n>0, let d = n-th digit in the sequence thus far. a(n) = a(n-1) + d if d is even. Otherwise, a(n) = a(n-1) - d.

%C "-" signs on negative values are ignored when determining the n-th digit.

%H Gavin Lupo, <a href="/A362896/b362896.txt">Table of n, a(n) for n = 0..10000</a>

%e a(0) = 2.

%e a(1) = 4. 1st digit is 2, which is even. 2 + 2 = 4.

%e a(2) = 8. 2nd digit is 4, which is even. 4 + 4 = 8.

%e a(3) = 16. 3rd digit is 8, which is even. 8 + 8 = 16.

%e a(4) = 15. 4th digit is 1, which is odd. 16 - 1 = 15.

%e a(5) = 21. 5th digit is 6, which is even. 15 + 6 = 21.

%o (Python)

%o a = [2]

%o split = []

%o for i in range(100):

%o split += [int(j) for j in str(abs(a[i]))]

%o if split[i] % 2 == 0:

%o a.append((a[i] + split[i]))

%o else:

%o a.append((a[i] - split[i]))

%o print(a)

%Y Cf. A362371, A362551.

%K sign,easy,base

%O 0,1

%A _Gavin Lupo_, May 09 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 4 23:31 EST 2024. Contains 370537 sequences. (Running on oeis4.)