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
0, 0, 0, 2, 14, 117, 1244, 16340, 256794, 4708235, 98765432, 2334368214, 61405650470, 1779714835745, 56358445438164, 1936265501684072, 71737338064426034, 2851241711464855575, 121019325106640638448, 5463472083532379956970, 261417839335180055401662, 13215375398730198560266829 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Digits 2..(n-1) in strict descending order (n-1)..2 interpreted in base n.
Upper bound of A370371(n) when n is odd and n-1 has an even 2-adic valuation.
LINKS
FORMULA
a(n) = (n - 2)*(n^(n - 1) - 1)/(n - 1)^2 for n > 1.
PROG
(Python)
def A370671(n): return (n-2)*(n**(n-1)-1)//(n-1)**2 if n > 1 else 0
CROSSREFS
Sequence in context: A231615 A277467 A208393 * A361962 A192457 A351856
KEYWORD
nonn
AUTHOR
Chai Wah Wu, Feb 25 2024
STATUS
approved

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 July 26 17:18 EDT 2024. Contains 374636 sequences. (Running on oeis4.)