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 A066275 #6 Oct 31 2015 14:17:29 %S A066275 0,1,10,111,1476,23255,425958,8915263,210156040,5513215599, %T A066275 159374246010,5034663700847,172583816090700,6380915666604583, %U A066275 253132868797656526,10725414213389814015,483431164831317069840 %N A066275 Number of endofunctions of [n] such that some element is fixed, but 1 is not fixed. %F A066275 a(n) = n^n-n^(n-1)-(n-1)^n. E.g.f.: (T^3-T^2+T-x)/(T-T^2), where T=T(x) is Euler's tree function (see A000169). %e A066275 a(2)=1: [1->2,2->2]. %p A066275 A066275 := proc(n) %p A066275 n^n-n^(n-1)-(n-1)^n ; %p A066275 end proc: # _R. J. Mathar_, Oct 31 2015 %Y A066275 Cf. A045531, A066274. %K A066275 nonn %O A066275 1,3 %A A066275 _Len Smiley_, Dec 09 2001