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 A115514 #40 Mar 15 2024 07:25:51
%S A115514 1,1,1,2,1,1,2,2,1,1,3,2,2,1,1,3,3,2,2,1,1,4,3,3,2,2,1,1,4,4,3,3,2,2,
%T A115514 1,1,5,4,4,3,3,2,2,1,1,5,5,4,4,3,3,2,2,1,1,6,5,5,4,4,3,3,2,2,1,1,6,6,
%U A115514 5,5,4,4,3,3,2,2,1,1,7,6,6,5,5,4,4,3,3,2,2,1,1,7,7,6,6,5,5,4,4,3,3,2,2,1,1
%N A115514 Triangle read by rows: row n >= 1 lists first n positive terms of A004526 (integers repeated) in decreasing order.
%C A115514 T(n,k) = number of 2-element subsets of {1,2,...,n+2} such that the absolute difference of the elements is k+1, where 1 <= k < = n. E.g., T(7,3) = 3, the subsets are {1,5}, {2,6}, and {3,7}. - _Christian Barrientos_, Jun 27 2022
%H A115514 G. C. Greubel, <a href="/A115514/b115514.txt">Rows n = 1..100 of the triangle, flattened</a>
%F A115514 Sum_{k=1..n} T(n, k) = A002620(n+1) (row sums). - _Gary W. Adamson_, Oct 25 2007
%F A115514 T(n, k) = [x^k] p(n), where p(n) are partial Gaussian polynomials (A008967) defined by p(n) = Sum_{k=0..n} Sum_{j=0..n-k} even(k)*x^j, and even(k) = 1 if k is even and otherwise 0. We assume offset 0. - _Peter Luschny_, Jun 03 2021
%F A115514 T(n, k) = floor((n+2-k)/2). - _Christian Barrientos_, Jun 27 2022
%F A115514 From _G. C. Greubel_, Mar 14 2024: (Start)
%F A115514 T(n, k) = A128623(n, k)/n.
%F A115514 Sum_{k=1..n} (-1)^(k-1)*T(n, k) = A142150(n+1).
%F A115514 Sum_{k=1..floor((n+1)/2)} T(n-k+1, k) = A008805(n-1).
%F A115514 Sum_{k=1..floor((n+1)/2)} (-1)^(k-1)*T(n-k+1, k) = A002265(n+3). (End)
%e A115514 Triangle begins as, for n >= 1, 1 <= k <= n,
%e A115514 1;
%e A115514 1, 1;
%e A115514 2, 1, 1;
%e A115514 2, 2, 1, 1;
%e A115514 3, 2, 2, 1, 1;
%e A115514 3, 3, 2, 2, 1, 1;
%e A115514 4, 3, 3, 2, 2, 1, 1;
%e A115514 ...
%p A115514 # Assuming offset 0:
%p A115514 Even := n -> (1 + (-1)^n)/2: # Iverson's even.
%p A115514 p := n -> add(add(Even(k)*x^j, j = 0..n-k), k = 0..n):
%p A115514 for n from 0 to 9 do seq(coeff(p(n), x, k), k=0..n) od; # _Peter Luschny_, Jun 03 2021
%t A115514 Table[Floor[(n-k+2)/2], {n,15}, {k,n}]//Flatten (* _G. C. Greubel_, Mar 14 2024 *)
%o A115514 (Magma) [Floor((n-k+2)/2): k in [1..n], n in [1..15]]; // _G. C. Greubel_, Mar 14 2024
%o A115514 (SageMath) flatten([[(n-k+2)//2 for k in range(1,n+1)] for n in range(1,16)]) # _G. C. Greubel_, Mar 14 2024
%Y A115514 Cf. A000012, A000073, A004526, A008805, A008967.
%Y A115514 Cf. A002620 (row sums), A008805 (diagonal sums), A142150 (alternating row sums)
%K A115514 nonn,tabl
%O A115514 1,4
%A A115514 _Roger L. Bagula_, Mar 07 2006
%E A115514 Edited by _N. J. A. Sloane_, Mar 23 2008 and Dec 15 2017