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.

A143425 Triangle read by rows A051731 * A130123, 1<=k<=n.

This page as a plain text file.
%I A143425 #8 Jul 01 2017 02:19:41
%S A143425 1,1,2,1,0,4,1,2,0,8,1,0,0,0,16,1,2,4,0,0,32,1,0,0,0,0,0,64,1,2,0,8,0,
%T A143425 0,0,128,1,0,4,0,0,0,0,0,256,1,2,0,0,16,0,0,0,0,512,1,0,0,0,0,0,0,0,0,
%U A143425 0,1024,1,2,4,8,0,32,0,0,0,0,0,2048
%N A143425 Triangle read by rows A051731 * A130123, 1<=k<=n.
%C A143425 Row sums = A034729: (1, 3, 5, 11, 17, ...).
%F A143425 Triangle read by rows A051731 * A130123, 1<=k<=n, where A130123 = an infinite lower triangular matrix with (1, 2, 4, 8, ...) in the main diagonal and the rest zeros. A051731 = the inverse Mobius transform.
%e A143425 First few rows of the triangle are:
%e A143425   1;
%e A143425   1, 2;
%e A143425   1, 0, 4;
%e A143425   1, 2, 0, 8;
%e A143425   1, 0, 0, 0, 16;
%e A143425   1, 2, 4, 0,  0, 32;
%e A143425   ...
%o A143425 (PARI) tabl(nn) = {ma = matrix(nn, nn, n, k, !(n%k)); mb = matrix(nn, nn, n, k, n--; k--; if (n==k, 2^n, 0)); m = ma*mb; for (n=1, nn, for (k=1, n, print1(m[n, k], ", ");); print(););} \\ _Michel Marcus_, Jun 30 2017
%Y A143425 Cf. A034729, A051731, A130123.
%K A143425 nonn,tabl
%O A143425 1,3
%A A143425 _Gary W. Adamson_, Aug 14 2008
%E A143425 Typo in data corrected by _Michel Marcus_, Jun 30 2017