A350127 a(n) = a(a(n-1)) mod 3 + a(n-2) with a(0) = 0 and a(1) = 1.
0, 1, 1, 2, 2, 3, 4, 5, 4, 7, 6, 8, 7, 10, 7, 12, 8, 13, 9, 14, 10, 14, 11, 16, 13, 17, 14, 18, 14, 19, 16, 21, 18, 21, 20, 22, 22, 24, 23, 25, 25, 27, 25, 29, 26, 31, 26, 33, 26, 35, 27, 35, 28, 37, 28, 39, 29, 40, 30, 41, 30, 42, 31, 42, 32, 42, 33, 42, 34
Offset: 0
Links
- Jon Maiga, Table of n, a(n) for n = 0..10000
Crossrefs
Cf. A350126.
Programs
-
Mathematica
a[0] = 0; a[1] = 1; a[n_] := a[n] = Mod[a[a[n - 1]], 3] + a[n - 2] Array[a, 100, 0]
-
Python
a = [0, 1] [a.append(a[a[n-1]]%3 + a[n-2]) for n in range(2, 69)] print(a) # Michael S. Branicky, Dec 15 2021
Comments