|
%I #46 Mar 21 2023 07:14:31
%S 1,1,2,1,1,3,1,1,1,4,1,1,1,1,5,1,1,1,1,1,6,1,1,1,1,1,1,7,1,1,1,1,1,1,
%T 1,8,1,1,1,1,1,1,1,1,9,1,1,1,1,1,1,1,1,1,10,1,1,1,1,1,1,1,1,1,1,11,1,
%U 1,1,1,1,1,1,1,1,1,1,12,1,1,1,1,1,1,1,1,1,1,1,1,13
%N A simple 2-dimensional array, read by antidiagonals: T[i,j] = 1 for j>0, T[i,0] = i+1; i,j = 0,1,2,3,...
%C Warning: contributions from Kimberling refer to an alternate version indexed by 1 instead of 0. Other contributors (Adamson in A125026/A130301/A130295) refer to this considering the upper right triangle set to zero, T[i,j]=0 for j>i. - _M. F. Hasler_, Aug 15 2015
%C From _Clark Kimberling_, Feb 05 2011: (Start)
%C A member of the accumulation chain:
%C ... < A051340 < A141419 < A185874 < A185875 < A185876 < ...
%C (See A144112 for the definition of accumulation array.)
%C In the m-th accumulation array of A051340,
%C row_1 = C(m,1) and column_1 = C(1,m+1), for m>=0. (End)
%H G. C. Greubel, <a href="/A051340/b051340.txt">Antidiagonals n = 0..100, flattened</a>
%H Johann Cigler, <a href="https://arxiv.org/abs/1611.05252">Some elementary observations on Narayana polynomials and related topics</a>, arXiv:1611.05252 [math.CO], 2016. See p. 24.
%H A. V. Mikhalev and A. A. Nechaev, <a href="http://dx.doi.org/10.1007/BF00047168">Linear recurring sequences over modules</a>, Acta Applic. Math., 42 (1996), 161-202.
%F For n>0, a(n(n+3)/2)=n+1, and if k is not of the form n*(n+3)/2, then a(k)=1. - _Benoit Cloitre_, Oct 31 2002, corrected by _M. F. Hasler_, Aug 15 2015
%F T(n,0) = n+1 and T(n,k) = 1 if k >= 0, for n >= 0. - _Clark Kimberling_, Feb 05 2011
%e Northwest corner:
%e 1...1...1...1...1...1...1
%e 2...1...1...1...1...1...1
%e 3...1...1...1...1...1...1
%e 4...1...1...1...1...1...1
%e 5...1...1...1...1...1...1
%e 6...1...1...1...1...1...1
%e The Mathematica code shows that the weight array of this array (i.e., the array of which this array is the accumulation array), has northwest corner
%e 1....0...0...0...0...0...0
%e 1...-1...0...0...0...0...0
%e 1...-1...0...0...0...0...0
%e 1...-1...0...0...0...0...0
%e 1...-1...0...0...0...0...0. - _Clark Kimberling_, Feb 05 2011
%p A051340 := proc(n, k) if k=0 then n+1; else 1; end if; end proc: # _R. J. Mathar_, Jul 16 2015
%t (* This program generates A051340, then its accumulation array A141419, then its weight array described under Example. *)
%t f[n_,0]:=0; f[0,k_]:=0; (* needed for the weight array *)
%t f[n_,1]:=n; f[n_,k_]:=1/;k>1;
%t TableForm[Table[f[n,k],{n,1,10},{k,1,15}]] (* A051340 *)
%t Table[f[n-k+1,k],{n,14},{k,n,1,-1}]//Flatten
%t s[n_,k_]:=Sum[f[i,j],{i,1,n},{j,1,k}]; (* accumulation array of {f(n,k)} *)
%t TableForm[Table[s[n,k],{n,1,10},{k,1,15}]] (* A141419 *)
%t Table[s[n-k+1,k],{n,14},{k,n,1,-1}]//Flatten
%t w[m_,n_]:=f[m,n]+f[m-1,n-1]-f[m,n-1]-f[m-1,n]/;Or[m>0,n>0];
%t TableForm[Table[w[n,k],{n,1,10},{k,1,15}]] (* weight array *)
%t Table[w[n-k+1,k],{n,14},{k,n,1,-1}]//Flatten (* _Clark Kimberling_, Feb 05 2011 *)
%t f[n_] := Join[ Table[1, {n - 1}], {n}]; Array[ f, 14] // Flatten (* _Robert G. Wilson v_, Mar 04 2012 *)
%o (Magma) [k eq n select n+1 else 1: k in [0..n], n in [0..15]]; // _G. C. Greubel_, Mar 18 2023
%o (SageMath)
%o def A051340(n,k): return n+1 if (k==n) else 1
%o flatten([[A051340(n,k) for k in range(n+1)] for n in range(16)]) # _G. C. Greubel_, Mar 18 2023
%Y Cf. A144112, A141419, A185874, A185875, A185876.
%K easy,nice,nonn,tabl
%O 0,3
%A _N. J. A. Sloane_
%E Edited by _M. F. Hasler_, Aug 15 2015
|
