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!)
A369337 Total number of numbers less than each divisor d of n that do not divide d. 1
0, 0, 1, 1, 3, 3, 5, 5, 7, 9, 9, 10, 11, 15, 15, 16, 15, 21, 17, 24, 23, 27, 21, 30, 25, 33, 30, 38, 27, 45, 29, 42, 39, 45, 39, 55, 35, 51, 47, 60, 39, 69, 41, 66, 60, 63, 45, 79, 51, 75, 63, 80, 51, 90, 63, 90, 71, 81, 57, 114, 59, 87, 86, 99, 75, 117, 65, 108, 87, 117, 69, 135, 71, 105 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
FORMULA
a(n) = Sum_{d|n} Sum_{k=1..d} ceiling(d/k) - floor(d/k).
a(n) = Sum_{k=1..n} Sum_{i=1..k} (ceiling(k/i) - floor(k/i)) * (1 - ceiling(n/k) + floor(n/k)).
EXAMPLE
a(12) = 10. The divisors of 12 are {1,2,3,4,6,12}. There are 0 numbers (positive integers) less than 1, 0 numbers less than 2 not dividing 2, 1 number less than 3 not dividing 3 (namely 2), 1 number less than 4 not dividing 4 (namely 3), 2 numbers less than 6 not dividing 6 (namely 4 and 5) and 6 numbers less than 12 not dividing 12 (namely 5,7,8,9,10,11).
MATHEMATICA
Table[Sum[Sum[(Ceiling[d/k] - Floor[d/k]), {k, d}], {d, Divisors[n]}], {n,
100}]
CROSSREFS
Cf. A369338.
Sequence in context: A339102 A095878 A341143 * A157966 A212597 A268188
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Jan 20 2024
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 September 12 09:47 EDT 2024. Contains 375850 sequences. (Running on oeis4.)