login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062363 a(n) = Sum_{d|n} d!. 8
0, 1, 3, 7, 27, 121, 729, 5041, 40347, 362887, 3628923, 39916801, 479002353, 6227020801, 87178296243, 1307674368127, 20922789928347, 355687428096001, 6402373706091609, 121645100408832001, 2432902008180268947 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Harry J. Smith, Table of n, a(n) for n = 0..100

FORMULA

G.f.: Sum_{m>0} m!*x^m/(1-x^m). - Vladeta Jovovic, Aug 06 2004

Inverse Moebius transform of factorials (A000142). - Jonathan Vos Post, Mar 19 2006

a(n) ~ n!. - Vaclav Kotesovec, Mar 14 2015

L.g.f.: -log(Product_{k>=1} (1 - x^k)^((k-1)!)) = Sum_{n>=1} a(n)*x^n/n. - Ilya Gutkovskiy, May 23 2018

EXAMPLE

The divisors of 3 are 1 and 3 so 1! + 3! = 7. The divisors of 4 are 1, 2 and 4 so 1! + 2! + 4! = 27.

MATHEMATICA

nmax=20; CoefficientList[Series[Sum[m!*x^m/(1-x^m), {m, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Mar 14 2015 *)

PROG

(PARI) a(n)=if(n<1, 0, sumdiv(n, d, d!));

CROSSREFS

Cf. A000142, A179327.

Sequence in context: A246313 A003083 A062795 * A333362 A242328 A136580

Adjacent sequences:  A062360 A062361 A062362 * A062364 A062365 A062366

KEYWORD

easy,nonn

AUTHOR

Jason Earls, Jul 07 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 2 06:02 EST 2021. Contains 341742 sequences. (Running on oeis4.)