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.
%I A065087 #37 Aug 18 2024 14:10:42
%S A065087 0,0,3,12,90,660,5565,51912,533988,6007320,73422855,969181620,
%T A065087 13744757598,208462156812,3367465610145,57727981888080,
%U A065087 1046800738237320,20020064118788592,402756584036805963,8502638996332570140,187953072550509445410,4341715975916768188740
%N A065087 a(n) = A000166(n)*binomial(n+1,2).
%C A065087 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
%H A065087 Seiichi Manyama, <a href="/A065087/b065087.txt">Table of n, a(n) for n = 0..400</a>
%F A065087 a(n) = (n/2)*A000240(n+1). - _Zerinvary Lajos_, Dec 18 2007, corrected Jul 09 2012
%F A065087 a(n) = n * (n+1) * (a(n-1)/(n-1) + (-1)^n/2) for n > 1 - _Seiichi Manyama_, Jun 24 2018
%F A065087 E.g.f.: exp(-x)*x^2*(3 - 2*x + x^2)/(2*(1 - x)^3). - _Ilya Gutkovskiy_, Jun 25 2018
%t A065087 a[n_] := Subfactorial[n]*Binomial[n + 1, 2];
%t A065087 Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Aug 18 2024 *)
%Y A065087 Equals 3 * A000313(n+2).
%Y A065087 Cf. A000166, A000240, A000387, A305730.
%K A065087 nonn
%O A065087 0,3
%A A065087 _N. J. A. Sloane_, Nov 10 2001