|
Search: id:A062363
|
|
| |
|
| 0, 1, 3, 7, 27, 121, 729, 5041, 40347, 362887, 3628923, 39916801, 479002353, 6227020801, 87178296243, 1307674368127, 20922789928347, 355687428096001, 6402373706091609, 121645100408832001, 2432902008180268947
(list; graph; listen)
|
|
|
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 (vladeta(AT)eunet.rs), Aug 06 2004
Inverse Moebius transform of factorials (A000142). - Jonathan Vos Post (jvospost3(AT)gmail.com), Mar 19 2006
|
|
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.
|
|
PROGRAM
|
(PARI) for(n=0, 22, print(sumdiv(n, d, d!)))
(PARI) { for (n=0, 100, if (n>0, a=sumdiv(n, d, d!), a=0); write("b062363.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 06 2009]
|
|
CROSSREFS
|
Cf. A000142.
Sequence in context: A081562 A003083 A062795 this_sequence A136580 A101303 A148751
Adjacent sequences: A062360 A062361 A062362 this_sequence A062364 A062365 A062366
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Jul 07 2001
|
|
|
Search completed in 0.002 seconds
|
