|
%I #48 Oct 29 2022 07:11:39
%S 1,3,3,6,6,6,10,10,10,10,15,15,15,15,15,21,21,21,21,21,21,28,28,28,28,
%T 28,28,28,36,36,36,36,36,36,36,36,45,45,45,45,45,45,45,45,45,55,55,55,
%U 55,55,55,55,55,55,55,66,66,66,66,66,66,66,66,66,66,66
%N Triangle read by rows, in which row n contains the triangular number T(n) = A000217(n) repeated n times; smallest triangular number greater than or equal to n.
%C Seen as a sequence, these are the triangular numbers applied to the Kruskal-Macaulay function A123578. - _Peter Luschny_, Oct 29 2022
%H Reinhard Zumkeller, <a href="/A127739/b127739.txt">Rows n=1..100 of triangle, flattened</a>
%H Boris Putievskiy, <a href="http://arxiv.org/abs/1212.2732">Transformations [of] Integer Sequences And Pairing Functions</a> arXiv:1212.2732 [math.CO], 2012.
%F Central terms: T(2*n-1,n) = A000384(n). - _Reinhard Zumkeller_, Mar 18 2011
%F a(n) = A003057(n)*A002024(n)/2; a(n) = (t+2)*(t+1)/2, where t=floor((-1+sqrt(8*n-7))/2). - _Boris Putievskiy_, Feb 08 2013
%F Sum_{n>=1} 1/a(n)^2 = 8 - 2*Pi^2/3. - _Amiram Eldar_, Aug 15 2022
%F a(n) = k(n)*(1 + k(n))/2 = A000217(A123578(n)), where k = A123578. - _Peter Luschny_, Oct 29 2022
%e First few rows of the triangle are:
%e 1;
%e 3, 3;
%e 6, 6, 6;
%e 10, 10, 10, 10;
%e 15, 15, 15, 15, 15;
%e ...
%p A127739 := proc(n) local t, s; t := 1; s := 0;
%p while t <= n do s := s + 1; t := t + s od; s*(1 + s)/2 end:
%p seq(A127739(n), n = 1..66); # _Peter Luschny_, Oct 29 2022
%t Table[n(n+1)/2,{n,100},{n}]//Flatten (* _Zak Seidov_, Mar 19 2011 *)
%o (Haskell)
%o a127739 n k = a127739_tabl !! (n-1) !! (k-1)
%o a127739_row n = a127739_tabl !! (n-1)
%o a127739_tabl = zipWith ($) (map replicate [1..]) $ tail a000217_list
%o -- _Reinhard Zumkeller_, Feb 03 2012, Mar 18 2011
%o (PARI) A127739=n->binomial((sqrtint(8*n)+3)\2,2) \\ _M. F. Hasler_, Mar 09 2014
%Y Cf. A000217, A000384, A002024, A002411 (row sums), A003057, A057944, A123578.
%K nonn,tabl
%O 1,2
%A _Gary W. Adamson_, Jan 27 2007
%E Name edited by _Michel Marcus_, Apr 30 2020
|
