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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A297792 a(n) = Sum_{d|n} min(d, n/d)^2. 5
1, 2, 2, 6, 2, 10, 2, 10, 11, 10, 2, 28, 2, 10, 20, 26, 2, 28, 2, 42, 20, 10, 2, 60, 27, 10, 20, 42, 2, 78, 2, 42, 20, 10, 52, 96, 2, 10, 20, 92, 2, 100, 2, 42, 70, 10, 2, 132, 51, 60, 20, 42, 2, 100, 52, 140, 20, 10, 2, 182, 2, 10, 118, 106, 52, 100, 2, 42, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
From Michel Marcus, Jan 09 2018: (Start)
a(p) = 2, for prime p.
a(2p) = 10, for odd prime p. (End)
a(r*p) = 2 + 2*r^2, where r, p are primes and p > r. - Bruno Berselli, Jan 09 2018
MATHEMATICA
a[n_] := Block[{d = Divisors@n}, Plus @@ (Min[#, n/#]^2 & /@ d)]; Array[a, 70] (* Robert G. Wilson v, Jan 06 2018 *)
PROG
(PARI) {a(n) = sumdiv(n, d, min(d, n/d)^2)}
CROSSREFS
Sum_{d|n} min(d, n/d)^k: A117004 (k=1), this sequence (k=2), A297793 (k=3), A297794 (k=4), A297795 (k=5).
Sequence in context: A096869 A345315 A154009 * A266722 A343511 A232625
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Jan 06 2018
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)