The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055928 Sum of square divisors of n! = sum of squares of divisors of the square root of largest square dividing n!. 1
 1, 1, 1, 5, 5, 210, 210, 850, 7735, 806806, 806806, 3229590, 3229590, 161479500, 1455090000, 23286770000, 23286770000, 838446909300, 838446909300, 83973923013750, 83973923013750, 10244818607677500, 10244818607677500 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Amiram Eldar, Table of n, a(n) for n = 1..505 FORMULA a(n) = A035316(n!) = A001157(A055772(n)) = A001157(A000188(n!)). 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 *) CROSSREFS A001157, A000142, A035316, A055772, A000188. Sequence in context: A229767 A215729 A094463 * A213145 A195567 A051716 Adjacent sequences: A055925 A055926 A055927 * A055929 A055930 A055931 KEYWORD nonn AUTHOR Labos Elemer, Jul 21 2000 STATUS approved

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

Last modified February 7 12:44 EST 2023. Contains 360123 sequences. (Running on oeis4.)