login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A227606 Number of lattice paths from {9}^n to {0}^n using steps that decrement one component such that for each point (p_1,p_2,...,p_n) we have p_1<=p_2<=...<=p_n. 2
1, 256, 3768209, 526701471002, 298985252352030713, 445073778727031182727610, 1344481798162876850603732892817, 6993293261428532974934599912795818724, 55994660641252674524946692511672567020920313, 637028433009539403532335279417025047587902906655768 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Vaclav Kotesovec, Table of n, a(n) for n = 0..25

MAPLE

b:= proc(l) option remember; `if`(l[-1]=0, 1, add(add(b(subsop(

      i=j, l)), j=`if`(i=1, 0, l[i-1])..l[i]-1), i=1..nops(l)))

    end:

a:= n-> `if`(n=0, 1, b([9$n])):

seq(a(n), n=0..10);

CROSSREFS

Row n=9 of A227578.

Sequence in context: A016832 A103350 A069447 * A016880 A227662 A262458

Adjacent sequences:  A227603 A227604 A227605 * A227607 A227608 A227609

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Jul 17 2013

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 October 16 21:10 EDT 2019. Contains 328103 sequences. (Running on oeis4.)