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.

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

This page as a plain text file.
%I A151657 #6 May 07 2020 22:33:16
%S A151657 0,1225,818300,160310458,22727054364,2892619063243,354402440786800,
%T A151657 42837393111682484,5153280785356119360,618914057659003904189,
%U A151657 74290570601695876667092,8915697686087571194412590,1069916360274028756641650036,128391238501628502906890984271
%N A151657 Number of permutations of 7 indistinguishable copies of 1..n with exactly 3 adjacent element pairs in decreasing order.
%H A151657 Andrew Howroyd, <a href="/A151657/b151657.txt">Table of n, a(n) for n = 1..200</a>
%F A151657 a(n) = 120^n - (7*n + 1)*36^n + binomial(7*n+1, 2)*8^n - binomial(7*n+1, 3). - _Andrew Howroyd_, May 07 2020
%o A151657 (PARI) a(n) = {120^n - (7*n + 1)*36^n + binomial(7*n+1, 2)*8^n - binomial(7*n+1, 3)} \\ _Andrew Howroyd_, May 07 2020
%Y A151657 Cf. A151625, A151656.
%K A151657 nonn
%O A151657 1,2
%A A151657 _R. H. Hardin_, May 29 2009
%E A151657 Terms a(7) and beyond from _Andrew Howroyd_, May 07 2020