login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A208621 Number of Young tableaux with 8 n-length rows, increasing entries down the columns and monotonic entries along the rows (first row increasing). 1
1, 1, 6435, 28440320, 1523926182363, 232075055225078521, 67887185669916054862201, 32104063492616280061833179530, 22081439406257212482754663652213531, 20535540740510211632088991774438342144131, 24486820402563168156475227361324722817780058649 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Also the number of (8*n-1)-step walks on n-dimensional cubic lattice from (1,0,...,0) to (8,8,...,8) with positive unit steps in all dimensions such that for each point (p_1,p_2,...,p_n) we have p_1<=p_2<=...<=p_n or p_1>=p_2>=...>=p_n.

LINKS

Table of n, a(n) for n=0..10.

CROSSREFS

Row n=8 of A208615.

Sequence in context: A222344 A194720 A140916 * A294855 A025040 A236092

Adjacent sequences:  A208618 A208619 A208620 * A208622 A208623 A208624

KEYWORD

nonn,walk

AUTHOR

Alois P. Heinz, Feb 29 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 04:49 EST 2021. Contains 349469 sequences. (Running on oeis4.)