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 A370671 #12 Feb 25 2024 15:32:04
%S A370671 0,0,0,2,14,117,1244,16340,256794,4708235,98765432,2334368214,
%T A370671 61405650470,1779714835745,56358445438164,1936265501684072,
%U A370671 71737338064426034,2851241711464855575,121019325106640638448,5463472083532379956970,261417839335180055401662,13215375398730198560266829
%N A370671 a(n) = Sum_{i=2..n-1} i*n^(i-2).
%C A370671 Digits 2..(n-1) in strict descending order (n-1)..2 interpreted in base n.
%C A370671 Upper bound of A370371(n) when n is odd and n-1 has an even 2-adic valuation.
%F A370671 a(n) = (n - 2)*(n^(n - 1) - 1)/(n - 1)^2 for n > 1.
%o A370671 (Python)
%o A370671 def A370671(n): return (n-2)*(n**(n-1)-1)//(n-1)**2 if n > 1 else 0
%Y A370671 Cf. A062813, A051846, A370371.
%K A370671 nonn
%O A370671 0,4
%A A370671 _Chai Wah Wu_, Feb 25 2024