The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Revision History for A147712

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Late-growing permutations: number of permutations of 14 indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations.
(history; published version)

#7 by Alois P. Heinz at Thu Aug 30 18:58:50 EDT 2018

STATUS

editing

approved

#6 by Alois P. Heinz at Thu Aug 30 18:58:48 EDT 2018

AUTHOR

R. H. Hardin , May 01 2009

STATUS

approved

editing

#5 by Alois P. Heinz at Tue Aug 13 14:03:32 EDT 2013

STATUS

editing

approved

#4 by Alois P. Heinz at Tue Aug 13 14:03:28 EDT 2013

CROSSREFS

Column k=14 of A215561.

STATUS

approved

editing

#3 by Russ Cox at Sat Mar 31 12:35:17 EDT 2012

AUTHOR

_R. H. Hardin (rhhardin(AT)att.net) _ May 01 2009

Discussion

Sat Mar 31

12:35

OEIS Server: https://oeis.org/edit/global/875

#2 by N. J. A. Sloane at Sat Oct 02 03:00:00 EDT 2010

KEYWORD

nonn,new

nonn

AUTHOR

Ron R. H. Hardin (rhhardin(AT)att.net) May 01 2009

#1 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010

NAME

Late-growing permutations: number of permutations of 14 indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations.

DATA

1, 2674440, 141371511060715200, 300084647544974128326709244080, 63459439063595192178662944522933222953984000

OFFSET

1,2

CROSSREFS

Cf. A147681.

KEYWORD

nonn

AUTHOR

Ron Hardin (rhhardin(AT)att.net) May 01 2009

STATUS

approved