This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A375584 #26 Aug 22 2024 03:40:13 %S A375584 0,3,1,7,5,9,8,6,4,2,1,7,5,0,9,8,3,4,2,6,7,0,9,2,1,5,4,8,6,3,8,9,4,5, %T A375584 3,6,2,0,1,7,3,6,7,4,2,0,9,5,8,1,2,5,8,1,4,3,6,7,9,0,9,4,3,8,6,1,7,2, %U A375584 0,5,5,8,6,9,7,2,0,1,3,4,6,1,2,3,0,4,5,9 %N A375584 a(n) = digit produced when the Michael Damm error-detecting algorithm is applied to n. %H A375584 H. Michael Damm, <a href="https://doi.org/10.1016/j.disc.2006.05.033">Totally anti-symmetric quasigroups for all orders n not equal to 2 or 6</a>, Discrete Math., 307:6 (2007), 715-729. %H A375584 Wikipedia, <a href="https://en.wikipedia.org/wiki/Damm_algorithm">Damm algorithm</a>. %o A375584 (Python) %o A375584 t = [ %o A375584 [0, 3, 1, 7, 5, 9, 8, 6, 4, 2], %o A375584 [7, 0, 9, 2, 1, 5, 4, 8, 6, 3], %o A375584 [4, 2, 0, 6, 8, 7, 1, 3, 5, 9], %o A375584 [1, 7, 5, 0, 9, 8, 3, 4, 2, 6], %o A375584 [6, 1, 2, 3, 0, 4, 5, 9, 7, 8], %o A375584 [3, 6, 7, 4, 2, 0, 9, 5, 8, 1], %o A375584 [5, 8, 6, 9, 7, 2, 0, 1, 3, 4], %o A375584 [8, 9, 4, 5, 3, 6, 2, 0, 1, 7], %o A375584 [9, 4, 3, 8, 6, 1, 7, 2, 0, 5], %o A375584 [2, 5, 8, 1, 4, 3, 6, 7, 9, 0] %o A375584 ] %o A375584 def a(n): %o A375584 i = 0 %o A375584 for d in str(n): %o A375584 i = t[i][int(d)] %o A375584 return i %o A375584 print([a(n) for n in range(0, 88)]) %Y A375584 Cf. A093018, A374967. %K A375584 nonn,base %O A375584 1,2 %A A375584 _DarĂo Clavijo_, Aug 19 2024