[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A243203 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Terms of a particular integer decomposition of N^N.
(history; published version)
#7 by N. J. A. Sloane at Mon Jun 02 01:45:54 EDT 2014
STATUS

proposed

approved

#6 by Stanislav Sykora at Sun Jun 01 17:30:13 EDT 2014
STATUS

editing

proposed

#5 by Stanislav Sykora at Sun Jun 01 17:30:07 EDT 2014
COMMENTS

Though the origins original contexts are different, this triangle matches that of A066324 except for row 0, and for the zero term of each row. It is conjectured that the present form might be more amenable for On this point, see the construction of generating functionscomment in A243202.

STATUS

proposed

editing

#4 by Stanislav Sykora at Sun Jun 01 17:07:03 EDT 2014
STATUS

editing

proposed

#3 by Stanislav Sykora at Sun Jun 01 17:06:39 EDT 2014
NAME

Flattened triangle of the terms Terms of an a particular integer decomposition of N^N.

COMMENTS

a(n) is an element in the triangle of terms t(N,j) = c(N,j)*binomial(N,j), N = 0,1,2,3,... denoting a row, and j = 0,1,2,...r. The coefficients c(N,j) are specified numerically by the formula below. The sum of any row is N^N. Note that all rows start with 0, which makes them easily recognizable.

The sum of every row is N^N.

Though the contexts origins are very different, this triangle matches that of A066324 except for row 0, and for the zero term of each row. It is conjectured that the present form might be more amenable for the construction of generating functions.

LINKS

Stanislav Sykora, <a href="/A243203/b243203.txt">Table of n, a(n) for n = rows 0..5150100, flattened</a>

S. Sykora, <a href="http://dx.doi.org/10.3247/SL5Math14.002">A Random Mapping Statistics and a Related Identity</a>, <a href="http://ebyte.it/library/Library.html#math">Stan's Library</a>, Volume V, June 2014.

#2 by Stanislav Sykora at Sun Jun 01 16:53:08 EDT 2014
NAME

allocated for Stanislav SykoraFlattened triangle of the terms of an integer decomposition of N^N.

DATA

0, 0, 1, 0, 2, 2, 0, 9, 12, 6, 0, 64, 96, 72, 24, 0, 625, 1000, 900, 480, 120, 0, 7776, 12960, 12960, 8640, 3600, 720, 0, 117649, 201684, 216090, 164640, 88200, 30240, 5040, 0, 2097152, 3670016, 4128768, 3440640, 2150400, 967680, 282240, 40320, 0

OFFSET

0,5

COMMENTS

a(n) is an element in the triangle of terms t(N,j) = c(N,j)*binomial(N,j), N = 0,1,2,3,... denoting a row, and j = 0,1,2,...r. The coefficients c(N,j) are specified numerically by the formula below. The sum of any row is N^N. Note that all rows start with 0, which makes them easily recognizable.

Though the contexts are very different, this triangle matches that of A066324 except for row 0, and for the zero term of each row.

LINKS

Stanislav Sykora, <a href="/A243203/b243203.txt">Table of n, a(n) for n = 0..5150</a>

FORMULA

c(N,j)=N^(N-j)*(j/N)*j! for N>0 and 0<=j<=N, and c(N,j)=0 otherwise.

EXAMPLE

The first rows of the triangle are (first item is the row number N):

0 0

1 0, 1

2 0, 2, 2

3 0, 9, 12, 6

4 0, 64, 96, 72, 24

5 0, 625, 1000, 900, 480, 120

6 0, 7776, 12960, 12960, 8640, 3600, 720

7 0, 117649, 201684, 216090, 164640, 88200, 30240, 5040

8 0, 2097152, 3670016, 4128768, 3440640, 2150400, 967680, 282240, 40320

PROG

(PARI) A243202(maxrow) = {

my(v, n, j, irow, f); v = vector((maxrow+1)*(maxrow+2)/2);

for(n=1, maxrow, irow=1+n*(n+1)/2; v[irow]=0; f=1;

for(j=1, n, f *= j; v[irow+j] = j*f*n^(n-j-1)*binomial(n, j); ); );

return(v); }

CROSSREFS
KEYWORD

allocated

nonn,tabl

AUTHOR

Stanislav Sykora, Jun 01 2014

STATUS

approved

editing

#1 by Stanislav Sykora at Sun Jun 01 08:43:52 EDT 2014
NAME

allocated for Stanislav Sykora

KEYWORD

allocated

STATUS

approved