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.

A152518 1/36 of the number of permutations of 8 indistinguishable copies of 1..n with exactly 2 local maxima.

This page as a plain text file.
%I A152518 #14 Jul 18 2020 10:03:51
%S A152518 0,7,1290,214713,35450244,5849546139,965177888238,159254380788525,
%T A152518 26276973131433672,4335700569742873071,715390594038180275346,
%U A152518 118039448016603095674977,19476508922742491987034060,3213623972252540268102877443,530247955421669426384081722614
%N A152518 1/36 of the number of permutations of 8 indistinguishable copies of 1..n with exactly 2 local maxima.
%H A152518 Andrew Howroyd, <a href="/A152518/b152518.txt">Table of n, a(n) for n = 1..200</a>
%H A152518 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (183,-3051,13365).
%F A152518 a(n) = (97*165^(n-1) - 97*9^(n-1) - 104*(n-1)*9^(n-1))/2028. - _Andrew Howroyd_, May 10 2020
%F A152518 From _Colin Barker_, Jul 18 2020: (Start)
%F A152518 G.f.: x^2*(7 + 9*x) / ((1 - 9*x)^2*(1 - 165*x)).
%F A152518 a(n) = 183*a(n-1) - 3051*a(n-2) + 13365*a(n-3) for n>3.
%F A152518 (End)
%o A152518 (PARI) a(n) = {(97*165^(n-1) - 97*9^(n-1) - 104*(n-1)*9^(n-1))/2028} \\ _Andrew Howroyd_, May 10 2020
%o A152518 (PARI) concat(0, Vec(x^2*(7 + 9*x) / ((1 - 9*x)^2*(1 - 165*x)) + O(x^17))) \\ _Colin Barker_, Jul 18 2020
%Y A152518 Cf. A152494, A334773.
%K A152518 nonn,easy
%O A152518 1,2
%A A152518 _R. H. Hardin_, Dec 06 2008
%E A152518 Terms a(7) and beyond from _Andrew Howroyd_, May 10 2020