[go: up one dir, main page]

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!)
A338689 a(n) = Sum_{d|n} (-1)^(d-1) * (n/d)^n * binomial(d+n/d-2, d-1). 2
1, 3, 28, 223, 3126, 44660, 823544, 16514047, 387538588, 9951176994, 285311670612, 8903202187413, 302875106592254, 11107259264162760, 437894348359764856, 18444492187995996159, 827240261886336764178, 39345059356329821149097 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
G.f.: Sum_{k>=1} (k * x/(1 + (k * x)^k))^k.
If p is prime, a(p) = (-1)^(p-1) + p^p.
MATHEMATICA
a[n_] := DivisorSum[n, (-1)^(# - 1) * (n/#)^n * Binomial[# + n/# - 2, # - 1] &]; Array[a, 20] (* Amiram Eldar, Apr 24 2021 *)
PROG
(PARI) a(n) = sumdiv(n, d, (-1)^(d-1)*(n/d)^n*binomial(d+n/d-2, d-1));
(PARI) N=20; x='x+O('x^N); Vec(sum(k=1, N, (k*x/(1+(k*x)^k))^k))
CROSSREFS
Sequence in context: A003466 A337590 A092637 * A094296 A172241 A321438
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Apr 24 2021
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 August 29 21:13 EDT 2024. Contains 375518 sequences. (Running on oeis4.)