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 A006183 M1663 #32 Jul 02 2025 16:01:54
%S A006183 1,2,6,22,98,522,3262,23486,191802,1753618,17755382,197282022,
%T A006183 2387112466,31249472282,440096734638,6635304614542,106638824162282,
%U A006183 1819969265702946,32873194861759462,626524419718239158,12565295306571352002,264532532769923200042
%N A006183 a(n) = (n+1)*a(n-1) + (2-n)*a(n-2).
%D A006183 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006183 F. C. Holroyd and W. J. G. Wingate, <a href="http://dx.doi.org/10.1016/S0012-365X(85)80003-0">Cycles in the complement of a tree or other graph</a>, Discrete Math., 55 (1985), 267-282.
%F A006183 G.f.: 2*Sum_{k>=0} k!*(x/(1-x))^k - 1 = Q(0) -1, where Q(k)= 1 + 1/(1 - x*(k+1)/(x*(k+1) + (1-x)/Q(k+1) )); (continued fraction). - _Sergei N. Gladkovskii_, Aug 08 2013
%t A006183 RecurrenceTable[{a[n] == (n + 1) a[n - 1] + (2 - n) a[n - 2], a[0] == 1, a[1] == 2}, a, {n, 20}] (* _Robert G. Wilson v_, Jun 15 2013 *)
%o A006183 (Magma) [n le 2 select n else n*Self(n-1)+(3-n)*Self(n-2): n in [1..30]]; // _Vincenzo Librandi_, Mar 06 2016
%Y A006183 Equals A030297(n-1) - A030297(n-2) + 1. Cf. A054096.
%Y A006183 Equals 2 * A001339(n+2).
%K A006183 nonn,easy
%O A006183 1,2
%A A006183 _N. J. A. Sloane_, _Simon Plouffe_
%E A006183 More terms from _James Sellers_, Aug 21 2000
%E A006183 a(1) from _Robert G. Wilson v_, Jun 15 2013
%E A006183 a(21)-a(22) from _Vincenzo Librandi_, Mar 06 2016