[go: up one dir, main page]

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!)
Revision History for A133111 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A133111 a(n) = (1/(1!*2!*3!*4!))*Sum_{1 <= x_1, x_2, x_3, x_4 <= n} |det V(x_1,x_2,x_3,x_4)|, where V(x_1,x_2,x_3,x_4) is the Vandermonde matrix of order 4.
(history; published version)
#20 by Alois P. Heinz at Sat May 11 19:11:44 EDT 2024
STATUS

proposed

approved

#19 by Jon E. Schoenfield at Sat May 11 19:07:25 EDT 2024
STATUS

editing

proposed

#18 by Jon E. Schoenfield at Sat May 11 19:07:22 EDT 2024
NAME

a(n) = ) = (1/(1!*2!*3!*4!)*sum {!))*Sum_{1 <= x_1, x_2, x_3, x_4 <= n} |det V(x_1,x_2,x_3,x_4)|, where V(x_1,x_2,x_3,x_4) is the Vandermonde matrix of order 4.

COMMENTS

Compare with A000292 and A040977 for the corresponding sums for the Vandermonde matrices of orderorders 2 and 3 respectively.

a(n)= ) = sum of dimensions of all irreducible polynomial representations of GL(4) whose highest weight is of the form (m1>= >= m2>= >= m3>= >= m4) and m1<= <= n. - Oded Yacobi (oyacobi(AT)math.ucsd.edu), Jul 24 2008

FORMULA

a(n) = ) = (1/288*sum {)*Sum_{1 <= i,j,k,l <= n} |(i-j)(i-k)(j-k)(i-l)(j-l)(k-l)|.

a(n) = sum {Sum_{i + j + k + l = n} i*j*k^2*l^3.

STATUS

approved

editing

#17 by Michael De Vlieger at Fri Mar 08 09:01:36 EST 2024
STATUS

reviewed

approved

#16 by Joerg Arndt at Fri Mar 08 02:51:44 EST 2024
STATUS

proposed

reviewed

#15 by Joerg Arndt at Fri Mar 08 02:51:41 EST 2024
STATUS

editing

proposed

#14 by Joerg Arndt at Fri Mar 08 02:51:39 EST 2024
MATHEMATICA

fa[n_] := n^2 (n^2 - 1)^2 (n^2 - 4) (n^2 - 9)/302400; Array[fa, 30] (* or *) (* _] (* _Robert G. Wilson v_, Sep 17 2007 *)

STATUS

proposed

editing

#13 by Joerg Arndt at Fri Mar 08 02:51:11 EST 2024
STATUS

editing

proposed

#12 by Joerg Arndt at Fri Mar 08 02:51:07 EST 2024
FORMULA

a(n) = 1/288*sum {1 <= i,j,k,l <= n} |(i-j)(i-k)(j-k)(i-l)(j-l)(k-l)|. G.f.: x^4*(1 + 5x + 5x^2 + x^3)/(1 - x)^11 . a(n) = n^2(n^2 - 1)^2(n^2 - 4)(n^2 - 9)/302400. a(n) = sum {i + j + k + l = n} i*j*k^2*l^3.)|.

G.f.: x^4*(1 + 5*x + 5*x^2 + x^3)/(1 - x)^11 .

a(n) = n^2*(n^2 - 1)^2*(n^2 - 4)*(n^2 - 9)/302400.

a(n) = sum {i + j + k + l = n} i*j*k^2*l^3.

KEYWORD

easy,nonn,changed,easy

STATUS

proposed

editing

#11 by Michel Marcus at Fri Mar 08 02:43:18 EST 2024
STATUS

editing

proposed

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 29 06:09 EDT 2024. Contains 375510 sequences. (Running on oeis4.)