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.

A160019 Triangle: Lodumo_2 applied to each row of Pascal's triangle .

This page as a plain text file.
%I A160019 #15 Feb 02 2020 22:22:46
%S A160019 1,1,3,1,0,3,1,3,5,7,1,0,2,4,3,1,3,0,2,5,7,1,0,3,2,5,4,7,1,3,5,7,9,11,
%T A160019 13,15,1,0,2,4,6,8,10,12,3,1,3,0,2,4,6,8,10,5,7,1,0,3,2,4,6,8,10,5,12,
%U A160019 7,1,3,5,7,0,2,4,6,9,11,13,15,1,0,2,4,3,6,8,10,5,12,14,16,7
%N A160019 Triangle: Lodumo_2 applied to each row of Pascal's triangle .
%H A160019 Andrew Howroyd, <a href="/A160019/b160019.txt">Table of n, a(n) for n = 0..1325</a>
%H A160019 OEIS wiki, <a href="https://oeis.org/wiki/Lodumo_transform">Lodumo transform</a>
%F A160019 T(n,0)=A000012(n)=1; T(n,1)=A010674(n). - _Philippe Deléham_, Nov 15 2011
%e A160019 Triangle begins:
%e A160019   1;
%e A160019   1, 3;
%e A160019   1, 0, 3;
%e A160019   1, 3, 5, 7;
%e A160019   1, 0, 2, 4, 3;
%e A160019   1, 3, 0, 2, 5, 7; ...
%o A160019 (PARI) \\ here S(n,k) is A047999.
%o A160019 S(n,k)={bitand(n-k, k)==0}
%o A160019 row(n)={my(v=vector(n+1), b=0); for(k=0, n, if(S(n,k), b++; v[1+k]=2*b-1, v[1+k]=2*(k-b))); v}
%o A160019 { for(n=0, 10, print(row(n))) } \\ _Andrew Howroyd_, Feb 02 2020
%Y A160019 Row sums are A160020.
%Y A160019 Cf. A007318, A047999, A261363.
%K A160019 easy,nonn,tabl
%O A160019 0,3
%A A160019 _Philippe Deléham_, Apr 29 2009, May 02 2009