login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089083 T(n,k) = (floor(k*n/2) * ceiling(k*n/2))^2, triangular array read by rows, 1 <= k <= n. 1

%I #17 Nov 16 2021 08:08:19

%S 0,1,16,4,81,400,16,256,1296,4096,36,625,3136,10000,24336,81,1296,

%T 6561,20736,50625,104976,144,2401,12100,38416,93636,194481,360000,256,

%U 4096,20736,65536,160000,331776,614656,1048576,400,6561,33124,104976,256036,531441,984064,1679616,2689600

%N T(n,k) = (floor(k*n/2) * ceiling(k*n/2))^2, triangular array read by rows, 1 <= k <= n.

%H Michael De Vlieger, <a href="/A089083/b089083.txt">Table of n, a(n) for n = 1..11325</a>, rows 1 <= n <= 150, flattened.

%F T(n,1) = A002620(n)^2;

%F T(n,2) = A000290(n)^2 for n > 1;

%F T(n,4) = A016742(n)^2 for n > 3.

%e Triangle begins:

%e 0

%e 1 16

%e 4 81 400

%e 16 256 1296 4096

%e 36 625 3136 10000 24336

%e ...

%t T[n_, k_] := Floor[k n/2]^2 * Ceiling[k n/2]^2;

%t Table[T[n, k], {n, 1, 10}, {k, 1, n}] // Flatten (* _Jean-François Alcover_, Nov 16 2021 *)

%K nonn,tabl

%O 1,3

%A _Reinhard Zumkeller_, Dec 04 2003

%E Name and formulas corrected by _Jean-François Alcover_, Nov 16 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 21 06:47 EDT 2024. Contains 375345 sequences. (Running on oeis4.)