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.

A151639 Number of permutations of 3 indistinguishable copies of 1..n with exactly 9 adjacent element pairs in decreasing order.

Original entry on oeis.org

0, 0, 0, 1, 1722320, 21475242671, 53885342499340, 59751188387945950, 40765121565728774056, 20317575263352346466495, 8176401371550779497913310, 2829198944755856389638829950, 877500019282729363773560673680, 251039391334595768636642931100892
Offset: 1

Views

Author

R. H. Hardin, May 29 2009

Keywords

Crossrefs

Column k=9 of A174266.

Programs

  • Mathematica
    T[n_, k_]:= T[n, k]= Sum[(-1)^(k-j)*Binomial[3*n+1, k-j+2]*(Binomial[j+1,3])^n, {j, 0, k+2}];
    Table[T[n, 9], {n, 30}] (* G. C. Greubel, Mar 26 2022 *)
  • Sage
    @CachedFunction
    def T(n, k): return sum( (-1)^(k-j)*binomial(3*n+1, k-j+2)*(binomial(j+1,3))^n for j in (0..k+2) )
    [T(n, 9) for n in (1..30)] # G. C. Greubel, Mar 26 2022

Formula

a(n) = Sum_{j=0..11} (-1)^(j+1)*binomial(3*n+1, 11-j)*(binomial(j+1, 3))^n. - G. C. Greubel, Mar 26 2022

Extensions

Terms a(9) and beyond from Andrew Howroyd, May 06 2020