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.

A151577 Number of permutations of 1..n arranged in a circle with exactly 4 adjacent element pairs in decreasing order.

Original entry on oeis.org

0, 5, 156, 2114, 19328, 140571, 882340, 5007112, 26441856, 132439905, 637468300, 2976161790, 13569454592, 60725449335, 267757190100, 1166662948900, 5034645823680, 21556696454685, 91704869986620, 388044105102650, 1634678955350400, 6860481786528275, 28700914012807556
Offset: 4

Views

Author

R. H. Hardin, May 21 2009

Keywords

Crossrefs

Column k=4 of A334218.
Cf. A000498.

Programs

  • PARI
    a(n) = {n*(4^(n-1) - n*3^(n-1) + binomial(n,2)*2^(n-1) - binomial(n,3))} \\ Andrew Howroyd, May 05 2020

Formula

From Andrew Howroyd, May 05 2020: (Start)
a(n) = n*A000498(n-1).
a(n) = n*(4^(n-1) - n*3^(n-1) + binomial(n,2)*2^(n-1) - binomial(n,3)). (End)

Extensions

Terms a(17) and beyond from Andrew Howroyd, May 05 2020