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.

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

This page as a plain text file.
%I A159734 #12 Jul 16 2020 13:34:49
%S A159734 80,8520,659560,46412200,3121135440,203933233280,13051880894720,
%T A159734 822269693093760,51163456598214400,3151668992962800640,
%U A159734 192538324414433556480,11680658351228331345920,704433549821153777192960,42266012989435750480281600,2524689842570106278817955840
%N A159734 Number of permutations of 5 indistinguishable copies of 1..n arranged in a circle with exactly 2 local maxima.
%H A159734 Andrew Howroyd, <a href="/A159734/b159734.txt">Table of n, a(n) for n = 2..200</a>
%H A159734 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (130,-5260,68760,-362880,677376).
%F A159734 a(n) = n*(23^2*56^(n-2) + 21*6^(n-2) - 75*n*6^(n-2))/10. - _Andrew Howroyd_, May 10 2020
%F A159734 From _Colin Barker_, Jul 16 2020: (Start)
%F A159734 G.f.: 40*x^2*(2 + 3*x)*(1 - 25*x - 303*x^2 + 252*x^3) / ((1 - 6*x)^3*(1 - 56*x)^2).
%F A159734 a(n) = 130*a(n-1) - 5260*a(n-2) + 68760*a(n-3) - 362880*a(n-4) + 677376*a(n-5) for n>6.
%F A159734 (End)
%o A159734 (PARI) a(n) = {n*(23^2*56^(n-2) + 21*6^(n-2) - 75*n*6^(n-2))/10} \\ _Andrew Howroyd_, May 10 2020
%o A159734 (PARI) Vec(40*x^2*(2 + 3*x)*(1 - 25*x - 303*x^2 + 252*x^3) / ((1 - 6*x)^3*(1 - 56*x)^2) + O(x^18)) \\ _Colin Barker_, Jul 16 2020
%Y A159734 Column k=5 of A334772.
%Y A159734 Cf. A159716.
%K A159734 nonn,easy
%O A159734 2,1
%A A159734 _R. H. Hardin_, Apr 20 2009
%E A159734 Terms a(7) and beyond from _Andrew Howroyd_, May 09 2020