|
Search: id:A107106
|
|
| |
|
| 1, 1, 1, 2, 1, 1, 6, 2, 1, 1, 1, 24, 6, 2, 2, 1, 1, 1, 120, 24, 6, 4, 6, 2, 1, 2, 1, 1, 1, 720, 120, 24, 12, 24, 6, 4, 2, 6, 2, 1, 2, 1, 1, 1, 5040, 720, 120, 48, 36, 120, 24, 12, 6, 4, 24, 6, 4, 2, 1, 6, 2, 1, 2, 1, 1, 1, 40320, 5040, 720, 240, 144, 720, 120, 48, 24, 36, 12, 8, 120, 24, 12
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
A107107 gives the row sums. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 13 2007
|
|
FORMULA
|
A107106(n) = A036039(n) / A036040(n)
|
|
EXAMPLE
|
A107106(22) = A036039(22) / A036040(22)
= 280 / 70
|
|
MAPLE
|
sortAbrSteg := proc(L1, L2) local i ; if nops(L1) < nops(L2) then RETURN(true) ; elif nops(L2) < nops(L1) then RETURN(false) ; else for i from 1 to nops(L1) do if op(i, L1) < op(i, L2) then RETURN(false) ; fi ; od ; RETURN(true) ; fi ; end: M2overM3 := proc(L) local n, k, an, resul; n := add(i, i=L) ; resul := 1 ; for k from 1 to n do an := add(1-min(abs(j-k), 1), j=L) ; resul := resul* (factorial(k-1))^an ; od ; end: A107106 := proc(n, k) local prts, m ; prts := combinat[partition](n) ; prts := sort(prts, sortAbrSteg) ; if k <= nops(prts) then M2overM3(op(k, prts)) ; else 0 ; fi ; end: for n from 1 to 10 do for k from 1 to combinat[numbpart](n) do a:=A107106(n, k) ; printf("%d, ", a) ; od; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 13 2007
|
|
CROSSREFS
|
Cf. A107107.
Sequence in context: A053383 A125731 A123361 this_sequence A119502 A136707 A085826
Adjacent sequences: A107103 A107104 A107105 this_sequence A107107 A107108 A107109
|
|
KEYWORD
|
easy,nonn,tabf
|
|
AUTHOR
|
Alford Arnold (Alford1940(AT)aol.com), May 12 2005
|
|
EXTENSIONS
|
Corrected and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 13 2007
|
|
|
Search completed in 0.002 seconds
|
