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 A006961 M2584 #20 Dec 04 2015 02:48:19
%S A006961 1,1,3,6,15,31,75,164,388,887,2092,4884,11599,27443,65509,156427,
%T A006961 375263,901353,2171313,5237581,12658815,30633725,74238228,180106656,
%U A006961 437437445,1063425655,2587564434,6301175326,15356071604,37448674536
%N A006961 Number of mappings from n points to themselves with in-degree <= 2.
%D A006961 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006961 N. G. de Bruijn, D. A. Klarner, <a href="http://dx.doi.org/10.1137/0603037">Multisets of aperiodic cycles</a>, SIAM J. Algebraic Discrete Methods, 3 (1982), no. 3, 359-368. MR0666861(84i:05008).
%F A006961 Let T(x) = x+x^2+x^3+2*x^4+3*x^5+6*x^6+11*x^7+ ... be the g.f. for A001190. Then the g.f. here is 1/(Prod_{k=1..oo} (1-T(x^k))). - _N. J. A. Sloane_, Mar 25 2014
%t A006961 max = 30; (* w(n) is A001190(n) *) w[0]=0; w[1]=1; w[n_] := w[n] = If[ OddQ[n], Sum[w[k]*w[n-k], {k, 1, (n-1)/2}], Sum[w[k]*w[n-k], {k, 1, n/2 - 1}] + (1/2)*w[n/2]*(1 + w[n/2]) ]; T[x_] := Sum[w[n] x^n, {n, 0, max}]; s = 1/Product[1-T[x^k], {k, 1, max}] + O[x]^max; CoefficientList[s, x] (* _Jean-François Alcover_, Dec 03 2015 *)
%Y A006961 Cf. A001190.
%K A006961 nonn,easy,nice
%O A006961 0,3
%A A006961 _Simon Plouffe_
%E A006961 More terms from _Jean-François Alcover_, Dec 03 2015