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.

A099169 a(n) = (1/n) * Sum_{k=0..n-1} C(n,k) * C(n,k+1) * (n-1)^k.

Original entry on oeis.org

1, 2, 11, 100, 1257, 20076, 387739, 8766248, 226739489, 6595646860, 212944033051, 7550600079672, 291527929539433, 12169325847587832, 545918747361417291, 26183626498897556176, 1336713063706757646465
Offset: 1

Views

Author

Ralf Stephan, Oct 09 2004

Keywords

Comments

A diagonal of Narayana array (A008550).

Crossrefs

Programs

  • Magma
    A099169:= func< n | (&+[Binomial(n, j)*Binomial(n-1,j)*(n-1)^j/(j+1): j in [0..n-1]]) >;
    [A099169(n): n in [1..30]]; // G. C. Greubel, Feb 16 2021
    
  • Maple
    A099169:= n-> add( binomial(n, j)*binomial(n-1,j)*(n-1)^j/(j+1), j=0..n-1);
    seq( A099169(n), n=1..30) # G. C. Greubel, Feb 16 2021
  • Mathematica
    Join[{1},Table[Sum[Binomial[n,k]Binomial[n,k+1](n-1)^k,{k,0,n-1}]/n,{n,2,20}]] (* Harvey P. Dale, Oct 07 2013 *)
    Table[Hypergeometric2F1[1-n,-n,2,-1+n],{n,1,20}] (* Vaclav Kotesovec, Apr 18 2014 *)
  • PARI
    a(n) = (1/n) * sum(k=0, n-1, binomial(n,k) * binomial(n,k+1) * (n-1)^k); \\ Michel Marcus, Feb 16 2021
  • Sage
    def A099169(n): return sum( binomial(n, j)*binomial(n-1,j)*(n-1)^j/(j+1) for j in [0..n-1])
    [A099169(n) for n in [1..30]] # G. C. Greubel, Feb 16 2021
    

Formula

From Vaclav Kotesovec, Apr 18 2014, extended Dec 01 2021: (Start)
a(n) = Hypergeometric2F1([1-n,-n], [2], -1+n).
a(n) ~ exp(2*sqrt(n)-2) * n^(n-7/4) / (2*sqrt(Pi)) * (1 + 119/(48*sqrt(n))). (End)