cp's OEIS Frontend

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.

A325820 Multiplication table for carryless product i X j in base 3 for i >= 0 and j >= 0, read by antidiagonals.

This page as a plain text file.
%I A325820 #25 Sep 27 2022 19:17:51
%S A325820 0,0,0,0,1,0,0,2,2,0,0,3,1,3,0,0,4,6,6,4,0,0,5,8,9,8,5,0,0,6,7,12,12,
%T A325820 7,6,0,0,7,3,15,16,15,3,7,0,0,8,5,18,11,11,18,5,8,0,0,9,4,21,24,13,24,
%U A325820 21,4,9,0,0,10,18,24,19,21,21,19,24,18,10,0,0,11,20,27,23,26,9,26,23,27,20,11,0,0,12,19,30,36,19,15,15,19,36,30,19,12,0
%N A325820 Multiplication table for carryless product i X j in base 3 for i >= 0 and j >= 0, read by antidiagonals.
%H A325820 Antti Karttunen, <a href="/A325820/b325820.txt">Table of n, a(n) for n = 0..10584; the first 145 antidiagonals of array</a>
%H A325820 <a href="/index/Ca#CARRYLESS">Index entries for sequences related to carryless arithmetic</a>
%e A325820 The array begins as:
%e A325820   0,  0,  0,  0,  0,  0,  0,  0,  0,   0,   0,   0,   0, ...
%e A325820   0,  1,  2,  3,  4,  5,  6,  7,  8,   9,  10,  11,  12, ...
%e A325820   0,  2,  1,  6,  8,  7,  3,  5,  4,  18,  20,  19,  24, ...
%e A325820   0,  3,  6,  9, 12, 15, 18, 21, 24,  27,  30,  33,  36, ...
%e A325820   0,  4,  8, 12, 16, 11, 24, 19, 23,  36,  40,  44,  48, ...
%e A325820   0,  5,  7, 15, 11, 13, 21, 26, 19,  45,  50,  52,  33, ...
%e A325820   0,  6,  3, 18, 24, 21,  9, 15, 12,  54,  60,  57,  72, ...
%e A325820   0,  7,  5, 21, 19, 26, 15, 13, 11,  63,  70,  68,  57, ...
%e A325820   0,  8,  4, 24, 23, 19, 12, 11, 16,  72,  80,  76,  69, ...
%e A325820   0,  9, 18, 27, 36, 45, 54, 63, 72,  81,  90,  99, 108, ...
%e A325820   0, 10, 20, 30, 40, 50, 60, 70, 80,  90, 100,  83, 120, ...
%e A325820   0, 11, 19, 33, 44, 52, 57, 68, 76,  99,  83,  91, 132, ...
%e A325820   0, 12, 24, 36, 48, 33, 72, 57, 69, 108, 120, 132, 144, ...
%e A325820   etc.
%e A325820 A(2,2) = 2*2 mod 3 = 1.
%o A325820 (PARI)
%o A325820 up_to = 105;
%o A325820 A325820sq(b, c) = fromdigits(Vec(Pol(digits(b,3))*Pol(digits(c,3)))%3, 3);
%o A325820 A325820list(up_to) = { my(v = vector(up_to), i=0); for(a=0,oo, for(col=0,a, if(i++ > up_to, return(v)); v[i] = A325820sq(a-col,col))); (v); };
%o A325820 v325820 = A325820list(up_to);
%o A325820 A325820(n) = v325820[1+n];
%Y A325820 Cf. A169999 (the main diagonal).
%Y A325820 Row/Column 0: A000004, Row/Column 1: A001477, Row/Column 2: A004488, Row/Column 3: A008585, Row/Column 4: A242399, Row/Column 9: A008591.
%Y A325820 Cf. A007089, A207669, A207670, A263273, A325825.
%Y A325820 Cf. A325821 (same table without the zero row and column).
%Y A325820 Cf. A048720 (binary), A059692 (decimal), A004247 (full multiply).
%K A325820 nonn,base,tabl
%O A325820 0,8
%A A325820 _Antti Karttunen_, May 22 2019