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 A258384 #17 Feb 26 2020 16:01:00
%S A258384 2,18,576,40000,4860000,914838624,246727835648,90275517038592,
%T A258384 43046721000000000,25937424601000000000,19271723592631858495488,
%U A258384 17310672267004940730236928,18492034350245752657180811264,23170856660867919150000000000000
%N A258384 a(n) = n^(n-1) * (n+1)^n.
%H A258384 Daniel Suteu, <a href="/A258384/b258384.txt">Table of n, a(n) for n = 1..20</a>
%F A258384 a(n) = n^(n-1) * (n+1)^n.
%F A258384 a(n) ~ e * n^(2n-1). - _Charles R Greathouse IV_, May 28 2015
%e A258384 a(3) = (3+1)^3 * 3^(3-1) = 4^3 * 3^2 = 64 * 9 = 576.
%t A258384 Table[n^(n - 1)*(n + 1)^n, {n, 16}] (* _Michael De Vlieger_, May 28 2015 *)
%o A258384 (Sidef)
%o A258384 func a(n) {
%o A258384 (n+1)**n * n**(n-1);
%o A258384 };
%o A258384 1.to(Math.inf).each { |n|
%o A258384 say a(n);
%o A258384 };
%o A258384 (PARI) a(n)=n^(n-1)*(n+1)^n \\ _Charles R Greathouse IV_, May 28 2015
%K A258384 easy,nonn
%O A258384 1,1
%A A258384 _Daniel Suteu_, May 28 2015
%E A258384 More terms from _Michael De Vlieger_, May 28 2015