cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A073575 Sum of factorial numbers dividing n.

Original entry on oeis.org

1, 3, 1, 3, 1, 9, 1, 3, 1, 3, 1, 9, 1, 3, 1, 3, 1, 9, 1, 3, 1, 3, 1, 33, 1, 3, 1, 3, 1, 9, 1, 3, 1, 3, 1, 9, 1, 3, 1, 3, 1, 9, 1, 3, 1, 3, 1, 33, 1, 3, 1, 3, 1, 9, 1, 3, 1, 3, 1, 9, 1, 3, 1, 3, 1, 9, 1, 3, 1, 3, 1, 33, 1, 3, 1, 3, 1, 9, 1, 3, 1, 3, 1, 9, 1, 3, 1, 3, 1, 9, 1, 3, 1, 3, 1, 33, 1, 3, 1, 3, 1, 9
Offset: 1

Views

Author

Vladeta Jovovic, Aug 27 2002

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Total[Select[Table[i!, {i, n}], Divisible[n, #] &]], {n, 102}] (* Jayanta Basu, Jul 01 2013 *)
  • PARI
    A073575(n) = { my(m=1, i=2, s=0); while(!(n%m), s += m; m *= i; i++); return(s); } \\ Antti Karttunen, Dec 19 2018

Formula

G.f.: Sum_{k>0} k!*x^(k!)/(1-x^(k!)). - Vladeta Jovovic, Dec 13 2002
a(n) = A007489(A055881(n)). - Antti Karttunen, Dec 19 2018