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.

A055928 Sum of square divisors of n! = sum of squares of divisors of the square root of largest square dividing n!.

Original entry on oeis.org

1, 1, 1, 5, 5, 210, 210, 850, 7735, 806806, 806806, 3229590, 3229590, 161479500, 1455090000, 23286770000, 23286770000, 838446909300, 838446909300, 83973923013750, 83973923013750, 10244818607677500, 10244818607677500
Offset: 1

Views

Author

Labos Elemer, Jul 21 2000

Keywords

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := If[OddQ[e], (p^(e+1)-1)/(p^2-1) , (p^(e+2)-1)/(p^2-1)]; a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n!]); Array[a, 23] (* Amiram Eldar, Aug 01 2019 *)

Formula

a(n) = A035316(n!) = A001157(A055772(n)) = A001157(A000188(n!)).