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 A353109 #21 Jun 02 2022 17:48:03 %S A353109 0,0,0,0,1,0,0,2,2,0,0,3,4,3,0,0,4,6,6,4,0,0,5,8,9,8,5,0,0,6,1,3,3,1, %T A353109 6,0,0,7,3,6,7,6,3,7,0,0,8,5,9,2,2,9,5,8,0,0,9,7,3,6,7,6,3,7,9,0,0,1, %U A353109 9,6,1,3,3,1,6,9,1,0,0,2,2,9,5,8,9,8,5,9,2,2,0 %N A353109 Array read by antidiagonals: A(n, k) is the digital root of n*k with n >= 0 and k >= 0. %F A353109 A(n, k) = A010888(A004247(n, k)). %F A353109 A(n, k) = A010888(A003991(n, k)) for n*k > 0. %e A353109 The array begins: %e A353109 0, 0, 0, 0, 0, 0, 0, 0, ... %e A353109 0, 1, 2, 3, 4, 5, 6, 7, ... %e A353109 0, 2, 4, 6, 8, 1, 3, 5, ... %e A353109 0, 3, 6, 9, 3, 6, 9, 3, ... %e A353109 0, 4, 8, 3, 7, 2, 6, 1, ... %e A353109 0, 5, 1, 6, 2, 7, 3, 8, ... %e A353109 0, 6, 3, 9, 6, 3, 9, 6, ... %e A353109 0, 7, 5, 3, 1, 8, 6, 4, ... %e A353109 ... %t A353109 A[i_,j_]:=If[i*j==0,0,1+Mod[i*j-1,9]];Flatten[Table[A[n-k,k],{n,0,12},{k,0,n}]] %o A353109 (PARI) T(n,k) = if (n && k, (n*k-1)%9+1, 0); \\ _Michel Marcus_, May 12 2022 %Y A353109 Cf. A003991, A004247, A010888, A056992 (diagonal), A073636, A139413, A180592, A180593, A180594, A180595, A180596, A180597, A180598, A180599, A303296, A336225, A353128 (antidiagonal sums), A353933, A353974 (partial sum of the main diagonal). %K A353109 nonn,tabl,base,easy %O A353109 0,8 %A A353109 _Stefano Spezia_, Apr 24 2022