login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A151657 Number of permutations of 7 indistinguishable copies of 1..n with exactly 3 adjacent element pairs in decreasing order. 1
0, 1225, 818300, 160310458, 22727054364, 2892619063243, 354402440786800, 42837393111682484, 5153280785356119360, 618914057659003904189, 74290570601695876667092, 8915697686087571194412590, 1069916360274028756641650036, 128391238501628502906890984271 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Andrew Howroyd, Table of n, a(n) for n = 1..200

FORMULA

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

PROG

(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

CROSSREFS

Cf. A151625, A151656.

Sequence in context: A250848 A014795 A267297 * A218273 A046177 A031748

Adjacent sequences:  A151654 A151655 A151656 * A151658 A151659 A151660

KEYWORD

nonn

AUTHOR

R. H. Hardin, May 29 2009

EXTENSIONS

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 10 00:05 EDT 2020. Contains 335570 sequences. (Running on oeis4.)