cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 21-24 of 24 results.

A227605 Number of lattice paths from {8}^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.

Original entry on oeis.org

1, 128, 491825, 12509563082, 1026843977181745, 187978502469162658572, 61845760669881132413037769, 31862864761563509123808857974124, 23408169635197679203800470649923362577, 22939433009552344381207995985855864376139032
Offset: 0

Views

Author

Alois P. Heinz, Jul 17 2013

Keywords

Crossrefs

Row n=8 of A227578.

Programs

  • 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([8$n])):
    seq(a(n), n=0..10);

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.

Original entry on oeis.org

1, 256, 3768209, 526701471002, 298985252352030713, 445073778727031182727610, 1344481798162876850603732892817, 6993293261428532974934599912795818724, 55994660641252674524946692511672567020920313, 637028433009539403532335279417025047587902906655768
Offset: 0

Views

Author

Alois P. Heinz, Jul 17 2013

Keywords

Crossrefs

Row n=9 of A227578.

Programs

  • 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);

A227601 Number of lattice paths from {n}^10 to {0}^10 using steps that decrement one component such that for each point (p_1,p_2,...,p_10) we have p_1<=p_2<=...<=p_10.

Original entry on oeis.org

1, 1, 58786, 72686739116, 569413385415535738, 15313737501505148093502344, 1003769793669980634048599763674485, 129559009610760457771091688202936893773393, 28544115728527488452514857447327666866636823456709
Offset: 0

Views

Author

Alois P. Heinz, Jul 17 2013

Keywords

Crossrefs

Column k=10 of A227578.

Programs

  • 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([n$10])):
    seq(a(n), n=0..10);

A227607 Number of lattice paths from {10}^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.

Original entry on oeis.org

1, 512, 29324405, 23076216957520, 93462550593036735356, 1174228543974568589770758656, 33976468300798036566458244068649205, 1869718376047919275097272876105318640045150, 171650174624972457949599385901886660192203614365332
Offset: 0

Views

Author

Alois P. Heinz, Jul 17 2013

Keywords

Crossrefs

Row n=10 of A227578.

Programs

  • 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([10$n])):
    seq(a(n), n=0..10);
Previous Showing 21-24 of 24 results.