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 A060836 #15 Dec 26 2024 15:20:44
%S A060836 0,0,0,0,44,264,924,2464,5544,11088,20328,34848,56628,88088,132132,
%T A060836 192192,272272,376992,511632,682176,895356,1158696,1480556,1870176,
%U A060836 2337720,2894320,3552120,4324320,5225220,6270264,7476084,8860544,10442784,12243264,14283808,16587648
%N A060836 Number of permutations of n letters where exactly 5 change position.
%H A060836 Harry J. Smith, <a href="/A060836/b060836.txt">Table of n, a(n) for n = 1..1000</a>
%H A060836 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (6,-15,20,-15,6,-1).
%F A060836 a(n) = 44*binomial(n, 5).
%F A060836 a(n) = a(n-1)*n/(n-5).
%F A060836 G.f.: 44*x^5/(1 - x)^6. - _Colin Barker_, Apr 22 2012
%e A060836 a(8) = a(7) * 8/(8-5) = 924 * 8/3 = 2464.
%o A060836 (PARI) a(n) = { 44*binomial(n, 5) } \\ _Harry J. Smith_, Jul 19 2009
%Y A060836 For changing 0, 1, 2, 3, 4, 5, n-4, n elements see A000012, A000004, A000217 (offset), A007290, A060008, A060836, A000475, A000166. Also see A000332, A008290.
%Y A060836 Rencontre sequences are A000166 A000240 A000387 A000449 and A000475.
%Y A060836 A diagonal of A008291.
%K A060836 nonn,easy
%O A060836 1,5
%A A060836 Robert Goodhand (rgoodhand(AT)hotmail.com), May 12 2001