|
%I #9 Aug 31 2017 03:16:47
%S 1,2,4,6,9,16,25,42,78,152,317,706,1685,4234,11173,30850,88804,265936,
%T 826931,2665434,8892534,30664346,109149206,400544458,1513655722,
%U 5884263058,23508569872,96437400910,405880177443
%N Row sums of A110537 viewed as a number triangle.
%C Sums of antidiagonals of A110537 when this is viewed as a number square.
%H G. C. Greubel, <a href="/A110538/b110538.txt">Table of n, a(n) for n = 1..710</a>
%F a(n) = Sum_{k=1..n} Sum_{j=1..min(n-k+1,k)} ceiling(j^(n-k+1)/(n-k+1)^j)*ceiling(j^k/k^j).
%t T[n_] := Sum[Sum[ Ceiling[j^(n - k + 1)/(n - k + 1)^j]*Ceiling[j^k/k^j], {j, 1, Min[n - k + 1, k]}], {k, 1, n}]; Table[T[n], {n, 1, 50}] (* _G. C. Greubel_, Aug 31 2017 *)
%o (PARI) for(n=1,25, print1(sum(k=1,n, sum(j=1,min(n-k+1,k), ceil(j^(n-k+1)/(n-k+1)^j)*ceil(j^k/k^j))), ", ")) \\ _G. C. Greubel_, Aug 31 2017
%K easy,nonn
%O 1,2
%A _Paul Barry_, Jul 25 2005
|
