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 A361390 #27 Mar 10 2023 09:32:45 %S A361390 1,0,1,0,1,1,0,1,2,1,0,1,4,3,1,0,1,8,9,4,1,0,1,6,7,6,5,1,0,1,2,1,4,5, %T A361390 6,1,0,1,4,3,6,5,6,7,1,0,1,8,9,4,5,6,9,8,1,0,1,6,7,6,5,6,3,4,9,1,0,1, %U A361390 2,1,4,5,6,1,2,1,10,1,0,1,4,3,6,5,6,7,6,9,100,11,1,0,1,8,9,4,5,6,9,8,1,1000,121,12,1 %N A361390 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) is carryless n^k base 10. %H A361390 Seiichi Manyama, <a href="/A361390/b361390.txt">Antidiagonals n = 0..139, flattened</a> %H A361390 David Applegate, Marc LeBrun and N. J. A. Sloane, <a href="http://neilsloane.com/doc/carry1.pdf">Carryless Arithmetic (I): The Mod 10 Version</a>. %H A361390 <a href="/index/Ca#CARRYLESS">Index entries for sequences related to carryless arithmetic</a> %e A361390 4 * 4 = 16, so T(4,2) = 6. 6 * 4 = 24, so T(4,3) = 4. %e A361390 Square array begins: %e A361390 1, 0, 0, 0, 0, 0, 0, 0, ... %e A361390 1, 1, 1, 1, 1, 1, 1, 1, ... %e A361390 1, 2, 4, 8, 6, 2, 4, 8, ... %e A361390 1, 3, 9, 7, 1, 3, 9, 7, ... %e A361390 1, 4, 6, 4, 6, 4, 6, 4, ... %e A361390 1, 5, 5, 5, 5, 5, 5, 5, ... %e A361390 1, 6, 6, 6, 6, 6, 6, 6, ... %e A361390 1, 7, 9, 3, 1, 7, 9, 3, ... %o A361390 (PARI) T(n, k) = fromdigits(Vec(Pol(digits(n))^k)%10); %Y A361390 Columns k=0..4 give A000012, A001477, A059729, A169885, A169886. %Y A361390 Rows n=0..4 give A000007, A000012, A000689, A001148, A168428. %Y A361390 T(11,k) gives A059734. %Y A361390 Main diagonal gives A361351. %Y A361390 Cf. A004248, A359697. %K A361390 nonn,tabl,base %O A361390 0,9 %A A361390 _Seiichi Manyama_, Mar 10 2023