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 A280494 #12 Jan 10 2017 19:12:56 %S A280494 1,1,2,1,0,3,1,0,2,4,1,0,3,0,5,1,0,0,2,3,6,1,0,0,0,0,0,7,1,0,0,0,2,0, %T A280494 4,8,1,0,3,0,0,0,7,0,9,1,0,0,0,3,2,0,6,5,10,1,0,0,0,0,0,0,0,0,0,11,1, %U A280494 0,0,0,0,0,2,0,3,4,6,12,1,0,0,0,0,0,0,0,0,0,0,0,13,1,0,0,0,0,0,0,2,0,0,0,0,7,14,1,0,0,0,0,0,0,0,0,0,3,0,5,0,15 %N A280494 Rows of triangular table A280499 read in reverse order. %C A280494 This is GF(2)[X] analog of A127013, using "carryless division in base-2" instead of ordinary division. %H A280494 Antti Karttunen, <a href="/A280494/b280494.txt">Table of n, a(n) for n = 1..8256; the first 128 rows of triangle</a> %H A280494 <a href="/index/Ge#GF2X">Index entries for sequences operating on polynomials in ring GF(2)[X]</a> %e A280494 The first 17 rows of the triangle: %e A280494 1 %e A280494 1 2 %e A280494 1 0 3 %e A280494 1 0 2 4 %e A280494 1 0 3 0 5 %e A280494 1 0 0 2 3 6 %e A280494 1 0 0 0 0 0 7 %e A280494 1 0 0 0 2 0 4 8 %e A280494 1 0 3 0 0 0 7 0 9 %e A280494 1 0 0 0 3 2 0 6 5 10 %e A280494 1 0 0 0 0 0 0 0 0 0 11 %e A280494 1 0 0 0 0 0 2 0 3 4 6 12 %e A280494 1 0 0 0 0 0 0 0 0 0 0 0 13 %e A280494 1 0 0 0 0 0 0 2 0 0 0 0 7 14 %e A280494 1 0 0 0 0 0 0 0 0 0 3 0 5 0 15 %e A280494 1 0 0 0 0 0 0 0 2 0 0 0 4 0 8 16 %e A280494 1 0 3 0 0 0 0 0 0 0 0 0 5 0 15 0 17 %o A280494 (Scheme) (define (A280494 n) (A280500bi (A002024 n) (A004736 n))) ;; Code for A280500bi given in A280500. %Y A280494 Cf. A048720, A127013, A280499, A280500, A280493 (the row sums). %K A280494 nonn,tabl %O A280494 1,3 %A A280494 _Antti Karttunen_, Jan 09 2017