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!)
A065087 a(n) = A000166(n)*binomial(n+1,2). 4
0, 0, 3, 12, 90, 660, 5565, 51912, 533988, 6007320, 73422855, 969181620, 13744757598, 208462156812, 3367465610145, 57727981888080, 1046800738237320, 20020064118788592, 402756584036805963, 8502638996332570140, 187953072550509445410, 4341715975916768188740 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

a(n) is also the number of permutations of [2n-1] having n-1 isolated fixed points (i.e. adjacent entries are not fixed points). Example: a(2)=3 because we have 132, 213, and 321. - Emeric Deutsch, Apr 18 2009

LINKS

Seiichi Manyama, Table of n, a(n) for n = 0..400

FORMULA

a(n) = (n/2)*A000240(n+1). - Zerinvary Lajos, Dec 18 2007, corrected Jul 09 2012

a(n) = n * (n+1) * (a(n-1)/(n-1) + (-1)^n/2) for n > 1 - Seiichi Manyama, Jun 24 2018

E.g.f.: exp(-x)*x^2*(3 - 2*x + x^2)/(2*(1 - x)^3). - Ilya Gutkovskiy, Jun 25 2018

CROSSREFS

Equals 3 * A000313(n+2).

Cf. A000166, A000240, A000387, A305730.

Sequence in context: A039305 A174463 A124191 * A305870 A058337 A025503

Adjacent sequences:  A065084 A065085 A065086 * A065088 A065089 A065090

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Nov 10 2001

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 May 28 21:37 EDT 2020. Contains 334690 sequences. (Running on oeis4.)