A004494 Tersum n + 5.
5, 3, 4, 8, 6, 7, 2, 0, 1, 14, 12, 13, 17, 15, 16, 11, 9, 10, 23, 21, 22, 26, 24, 25, 20, 18, 19, 32, 30, 31, 35, 33, 34, 29, 27, 28, 41, 39, 40, 44, 42, 43, 38, 36, 37, 50, 48, 49, 53, 51, 52, 47, 45, 46, 59, 57, 58, 62, 60, 61, 56, 54, 55, 68, 66, 67, 71, 69
Offset: 0
Links
- Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,1,-1).
Crossrefs
Cf. A004489.
Programs
-
Mathematica
LinearRecurrence[{1, 0, 0, 0, 0, 0, 0, 0, 1, -1}, {5, 3, 4, 8, 6, 7, 2, 0, 1, 14}, 80] (* Jinyuan Wang, Mar 10 2020 *)
-
Python
# T(n, m) in A004489 def a(n): return T(n, 5) print([a(n) for n in range(68)]) # Michael S. Branicky, May 03 2021
Formula
Tersum m + n : write m and n in base 3 and add mod 3 with no carries, e.g. 5 + 8 = "21" + "22" = "10" = 1.