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 A190295 #18 Jul 22 2025 12:02:14
%S A190295 1,2,2,12,12,3,108,108,36,4,1280,1280,480,80,5,18750,18750,7500,1500,
%T A190295 150,6,326592,326592,136080,30240,3780,252,7,6588344,6588344,2823576,
%U A190295 672280,96040,8232,392,8
%N A190295 A055134(n,k)*k.
%C A190295 Triangular array read by rows. T(n,k) is the total number of fixed points in the endofunctions on {1,2,...,n} that have exactly k fixed points.
%C A190295 Row sums = A000312 = n^n so we see the expected number of fixed points is 1.
%C A190295 T(n,k) is also the number of endofunctions f:{1,2,...,n}->{1,2,...,n} in which there are exactly k elements j in {1,2,...,n-1} such that f(j)= f(j+1). - _Geoffrey Critzer_, Jun 25 2013
%F A190295 O.g.f. for row n: n*((n-1)+x)^(n-1)
%e A190295 Triangle begins
%e A190295 1
%e A190295 2 2
%e A190295 12 12 3
%e A190295 108 108 36 4
%e A190295 1280 1280 480 80 5
%e A190295 18750 18750 7500 1500 150 6
%t A190295 Flatten[CoefficientList[Table[Series[n((n-1)+x)^(n-1),{x,0,20}],{n,1,8}],x]]
%K A190295 nonn,tabl
%O A190295 1,2
%A A190295 _Geoffrey Critzer_, May 07 2011