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.

A159737 Number of permutations of 6 indistinguishable copies of 1..n arranged in a circle with exactly 2 local maxima.

Original entry on oeis.org

150, 22680, 2596608, 273322980, 27558217008, 2700777267972, 259275295383552, 24501521550788100, 2286808732032093360, 211301127303186249252, 19362866942233277773632, 1762020891775616889450852, 159395120671659354639719856, 14345560860451487040265198020
Offset: 2

Views

Author

R. H. Hardin, Apr 20 2009

Keywords

Crossrefs

Column k=6 of A334772.
Cf. A159716.

Programs

  • PARI
    a(n) = {3*n*(61^2*84^(n-2) + 96*7^(n-2) - 396*n*7^(n-2))/121} \\ Andrew Howroyd, May 10 2020
    
  • PARI
    Vec(6*x^2*(5 + 7*x)*(5 - 196*x - 2401*x^2 + 2058*x^3) / ((1 - 7*x)^3*(1 - 84*x)^2) + O(x^40)) \\ Colin Barker, Jul 18 2020

Formula

a(n) = 3*n*(61^2*84^(n-2) + 96*7^(n-2) - 396*n*7^(n-2))/121. - Andrew Howroyd, May 10 2020
From Colin Barker, Jul 18 2020: (Start)
G.f.: 6*x^2*(5 + 7*x)*(5 - 196*x - 2401*x^2 + 2058*x^3) / ((1 - 7*x)^3*(1 - 84*x)^2).
a(n) = 189*a(n-1) - 10731*a(n-2) + 173215*a(n-3) - 1094856*a(n-4) + 2420208*a(n-5) for n>6.
(End)

Extensions

Terms a(7) and beyond from Andrew Howroyd, May 09 2020