login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A370671 a(n) = Sum_{i=2..n-1} i*n^(i-2). 1

%I #12 Feb 25 2024 15:32:04

%S 0,0,0,2,14,117,1244,16340,256794,4708235,98765432,2334368214,

%T 61405650470,1779714835745,56358445438164,1936265501684072,

%U 71737338064426034,2851241711464855575,121019325106640638448,5463472083532379956970,261417839335180055401662,13215375398730198560266829

%N a(n) = Sum_{i=2..n-1} i*n^(i-2).

%C Digits 2..(n-1) in strict descending order (n-1)..2 interpreted in base n.

%C Upper bound of A370371(n) when n is odd and n-1 has an even 2-adic valuation.

%F a(n) = (n - 2)*(n^(n - 1) - 1)/(n - 1)^2 for n > 1.

%o (Python)

%o def A370671(n): return (n-2)*(n**(n-1)-1)//(n-1)**2 if n > 1 else 0

%Y Cf. A062813, A051846, A370371.

%K nonn

%O 0,4

%A _Chai Wah Wu_, Feb 25 2024

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 31 17:26 EDT 2024. Contains 375572 sequences. (Running on oeis4.)