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.

A362326 Pairs (i, j) of nonnegative integers whose ternary expansions have no common digit 1 sorted first by i + j then by i.

This page as a plain text file.
%I A362326 #10 Apr 20 2023 03:52:40
%S A362326 0,0,0,1,1,0,0,2,2,0,0,3,1,2,2,1,3,0,0,4,1,3,2,2,3,1,4,0,0,5,2,3,3,2,
%T A362326 5,0,0,6,1,5,2,4,4,2,5,1,6,0,0,7,1,6,2,5,5,2,6,1,7,0,0,8,2,6,6,2,8,0,
%U A362326 0,9,1,8,2,7,3,6,6,3,7,2,8,1,9,0,0,10
%N A362326 Pairs (i, j) of nonnegative integers whose ternary expansions have no common digit 1 sorted first by i + j then by i.
%C A362326 This sequence is to Sierpinski carpet what A352909 is to Sierpinski gasket.
%C A362326 There are A293974(n + 1) pairs (i, j) with n = i + j.
%C A362326 See A362329 for the other pairs.
%H A362326 Wikipedia, <a href="https://en.wikipedia.org/wiki/Sierpi%C5%84ski_carpet">Sierpiński carpet</a>
%e A362326 The first pairs are:
%e A362326     (0, 0),
%e A362326     (0, 1), (1, 0),
%e A362326     (0, 2), (2, 0),
%e A362326     (0, 3), (1, 2), (2, 1), (3, 0),
%e A362326     (0, 4), (1, 3), (2, 2), (3, 1), (4, 0),
%e A362326     (0, 5), (2, 3), (3, 2), (5, 0),
%e A362326     (0, 6), (1, 5), (2, 4), (4, 2), (5, 1), (6, 0),
%e A362326     (0, 7), (1, 6), (2, 5), (5, 2), (6, 1), (7, 0),
%e A362326     (0, 8), (2, 6), (6, 2), (8, 0),
%e A362326     ...
%o A362326 (PARI) is(i, j) = { while (i && j, if (i%3==1 && j%3==1, return (0), i\=3; j\=3;);); return (1); }
%o A362326 row(ij) = apply (i -> [i, ij-i], select(i -> is(i, ij-i), [0..ij]))
%Y A362326 Cf. A293974, A352909, A362327 (i-values), A362328 (j-values), A362329 (complement).
%K A362326 nonn,tabf,base
%O A362326 1,8
%A A362326 _Rémy Sigrist_, Apr 16 2023