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 A258385 #16 Sep 08 2022 08:46:12
%S A258385 0,8,648,82944,16000000,4374000000,1613775332736,773738492592128,
%T A258385 467988280328060928,348678440100000000000,313842837672100000000000,
%U A258385 335790511878017502425382912,421272520289832237611045879808,612530145817540311016457192308736
%N A258385 a(n) = n^(n+1) * (n-1)^n.
%H A258385 Daniel Suteu, <a href="/A258385/b258385.txt">Table of n, a(n) for n = 1..20</a>
%F A258385 a(n) ~ 1/e * n^(2n+1). - _Charles R Greathouse IV_, May 28 2015
%F A258385 a(n) = A007778(n)*A007778(n-1). - _Michel Marcus_, Jul 07 2015
%e A258385 For n=3, a(3) = 3^(3+1) * (3-1)^3 = 3^4 * 2^3 = 81 * 8 = 648.
%t A258385 Array[#^(# + 1) (# - 1)^# &, 20] (* _Vincenzo Librandi_, May 29 2015 *)
%o A258385 (Sidef)
%o A258385 func a(n) {
%o A258385 (n-1)**n * n**(n+1);
%o A258385 };
%o A258385 1.to(Math.inf).each { |n|
%o A258385 say a(n);
%o A258385 };
%o A258385 (PARI) a(n)=n^(n+1)*(n-1)^n \\ _Charles R Greathouse IV_, May 28 2015
%o A258385 (Magma) [n^(n+1) * (n-1)^n: n in [1..20]]; // _Vincenzo Librandi_, May 29 2015
%Y A258385 Cf. A007778 (n^(n+1)).
%K A258385 nonn,easy
%O A258385 1,2
%A A258385 _Daniel Suteu_, May 28 2015
%E A258385 More terms from _Vincenzo Librandi_, May 29 2015