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.

A134061 Triangle read by rows: T(n,k) = A124928(n,k) + A134059(n,k) - A007318(n,k).

This page as a plain text file.
%I A134061 #15 May 31 2025 09:42:30
%S A134061 1,3,5,3,10,5,3,15,15,5,3,20,30,20,5,3,25,50,50,25,5,3,30,75,100,75,
%T A134061 30,5,3,35,105,175,175,105,35,5,3,40,140,280,350,280,140,40,5,3,45,
%U A134061 180,420,630,630,420,180,45,5,3,50,225,600,1050,1260,1050,600,225,50,5
%N A134061 Triangle read by rows: T(n,k) = A124928(n,k) + A134059(n,k) - A007318(n,k).
%C A134061 Row sums = A134062: (1, 8, 18, 38, 78, 158, ...).
%F A134061 T(n,k) = 5*binomial(n,k) if k > 0, (0 <= k <= n), with leftmost column = (1,3,3,3,...).
%e A134061 First few rows of the triangle:
%e A134061   1;
%e A134061   3,  5;
%e A134061   3, 10,  5;
%e A134061   3, 15, 15,  5;
%e A134061   3, 20, 30, 20,  5;
%e A134061   3, 25, 50, 50, 25,  5;
%e A134061   ...
%t A134061 Table[If[k > 0, 3*Binomial[n, k], 1] + 2*Binomial[n, k] - 2*Boole[n == 0], {n, 0, 10}, {k, 0, n}] // Flatten (* _Amiram Eldar_, May 31 2025 *)
%Y A134061 Cf. A007318, A124928, A134059, A134062 (row sums).
%K A134061 nonn,tabl,easy
%O A134061 0,2
%A A134061 _Gary W. Adamson_, Oct 05 2007
%E A134061 More terms from _Amiram Eldar_, May 31 2025