Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093791
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093791 Hook products of all partitions of 12. +0
1
62208, 82944, 82944, 85050, 85050, 107520, 107520, 115200, 115200, 129600, 129600, 134400, 134400, 136080, 136080, 155520, 155520, 161280, 161280, 179200, 179200, 181440, 201600, 201600, 226800, 226800, 228096, 230400, 230400, 248832 (list; graph; listen)
OFFSET

1,1

COMMENT

a(n)=12!/A003876(n).

MAPLE

H:=proc(pa) local F, j, p, Q, i, col, a, A: F:=proc(x) local i, ct: ct:=0: for i from 1 to nops(x) do if x[i]>1 then ct:=ct+1 else fi od: ct; end: for j from 1 to nops(pa) do p[1][j]:=pa[j] od: Q[1]:=[seq(p[1][j], j=1..nops(pa))]: for i from 2 to pa[1] do for j from 1 to F(Q[i-1]) do p[i][j]:=Q[i-1][j]-1 od: Q[i]:=[seq(p[i][j], j=1..F(Q[i-1]))] od: for i from 1 to pa[1] do col[i]:=[seq(Q[i][j]+nops(Q[i])-j, j=1..nops(Q[i]))] od: a:=proc(i, j) if i<=nops(Q[j]) and j<=pa[1] then Q[j][i]+nops(Q[j])-i else 1 fi end: A:=matrix(nops(pa), pa[1], a): product(product(A[m, n], n=1..pa[1]), m=1..nops(pa)); end: with(combinat): rev:=proc(a) [seq(a[nops(a)+1-i], i=1..nops(a))] end: sort([seq(H(rev(partition(12)[q])), q=1..numbpart(12))]);

CROSSREFS

Cf. A003876.

Adjacent sequences: A093788 A093789 A093790 this_sequence A093792 A093793 A093794

Sequence in context: A112015 A128879 A089009 this_sequence A135430 A049025 A115748

KEYWORD

fini,nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), May 17 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research