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

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063839 Dirichlet convolution of Fibonacci numbers with factorials. 1
 1, 3, 8, 29, 125, 738, 5053, 40371, 362926, 3628985, 39916889, 479002546, 6227021033, 87178296643, 1307674368880, 20922789929421, 355687428097597, 6402373706095020, 121645100408836181, 2432902008180276155 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harry J. Smith, Table of n, a(n) for n = 1..100 FORMULA a(n) ~ n!. - Vaclav Kotesovec, Jan 28 2019 MATHEMATICA Table[Sum[Fibonacci[d]*(n/d)!, {d, Divisors[n]}], {n, 1, 20}] (* Vaclav Kotesovec, Jan 28 2019 *) PROG (PARI) for(n=1, 23, print(sumdiv(n, d, fibonacci(d)*(n/d)!))) (PARI) { for (n=1, 100, write("b063839.txt", n, " ", sumdiv(n, d, fibonacci(d)*(n/d)!)) ) } \\ Harry J. Smith_, Sep 01 2009 CROSSREFS Cf. A000045, A000142. Sequence in context: A245889 A013309 A058378 * A192744 A130470 A275166 Adjacent sequences:  A063836 A063837 A063838 * A063840 A063841 A063842 KEYWORD easy,nonn AUTHOR Jason Earls, Aug 25 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.

Last modified December 2 10:39 EST 2020. Contains 338876 sequences. (Running on oeis4.)