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 A362312 #17 Apr 18 2023 05:11:54 %S A362312 0,1,2,2,1,3,0,2,4,4,3,5,1,0,6,6,0,1,5,7,3,4,2,5,8,6,9,8,7,9,4,3,8,10, %T A362312 3,4,11,11,5,6,0,1,3,4,10,12,2,5,13,13,6,4,1,0,7,5,12,14,5,6,7,2,3,9, %U A362312 15,15,7,8,1,9,0,2,5,6,4,10,11,12,13,14,16,16,14 %N A362312 Sierpinski triangle read by rows and filled in the greedy way such that each row, each diagonal and each antidiagonal contains distinct nonnegative values. %C A362312 This sequence is a variant of A296339. %C A362312 The n-th row has A001316(n) terms, the first one being n and the last one being A361740(n). %H A362312 Rémy Sigrist, <a href="/A362312/b362312.txt">Table of n, a(n) for n = 0..6560</a> (rows for n = 0..255 flattened) %H A362312 Rémy Sigrist, <a href="/A362312/a362312.png">Colored representation of the first 512 rows</a> (the hue is function of the terms, black pixels denote 0's, white pixels denote empty places) %H A362312 Rémy Sigrist, <a href="/A362312/a362312.txt">C++ program</a> %e A362312 Sierpinski triangle begins (with dots denoting empty places): %e A362312 0 %e A362312 1 2 %e A362312 2 . 1 %e A362312 3 0 2 4 %e A362312 4 . . . 3 %e A362312 5 1 . . 0 6 %e A362312 6 . 0 . 1 . 5 %e A362312 7 3 4 2 5 8 6 9 %e A362312 8 . . . . . . . 7 %e A362312 9 4 . . . . . . 3 8 %e A362312 10 . 3 . . . . . 4 . 11 %e A362312 11 5 6 0 . . . . 1 3 4 10 %e A362312 12 . . . 2 . . . 5 . . . 13 %e A362312 13 6 . . 4 1 . . 0 7 . . 5 12 %e A362312 14 . 5 . 6 . 7 . 2 . 3 . 9 . 15 %e A362312 15 7 8 1 9 0 2 5 6 4 10 11 12 13 14 16 %o A362312 (C++) See Links section. %Y A362312 Cf. A001316, A296339, A361740 (right border), A362313 (least values). %K A362312 nonn,tabf %O A362312 0,3 %A A362312 _Rémy Sigrist_, Apr 15 2023