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!)
A367628 Sum of the divisors of n <= tau(n). 0
1, 3, 1, 3, 1, 6, 1, 7, 4, 3, 1, 16, 1, 3, 4, 7, 1, 12, 1, 12, 4, 3, 1, 24, 1, 3, 4, 7, 1, 17, 1, 7, 4, 3, 1, 25, 1, 3, 4, 20, 1, 19, 1, 7, 9, 3, 1, 24, 1, 8, 4, 7, 1, 12, 1, 22, 4, 3, 1, 43, 1, 3, 4, 7, 1, 12, 1, 7, 4, 15, 1, 45, 1, 3, 9, 7, 1, 12, 1, 30, 4, 3, 1, 35, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
First differs from A126212(n) at a(25) = 1.
LINKS
FORMULA
a(n) = Sum_{d|n, d<=tau(n)} d.
EXAMPLE
a(12) = 16. The sum of the divisors of 12 <= tau(12) = 6 are 1 + 2 + 3 + 4 + 6 = 16.
MATHEMATICA
Table[Sum[k(1-Ceiling[n/k]+Floor[n/k]), {k, DivisorSigma[0, n]}], {n, 100}]
PROG
(PARI) a(n) = my(t=numdiv(n)); sumdiv(n, d, if (d <=t, d)); \\ Michel Marcus, Nov 25 2023
CROSSREFS
Cf. A000005 (tau), A126212, A366979.
Sequence in context: A236865 A236829 A236800 * A126212 A357858 A066637
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Nov 24 2023
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 August 23 22:54 EDT 2024. Contains 375396 sequences. (Running on oeis4.)