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!)
A337681 Number of distinct positive integer pairs, (s,t), such that s < t < n where neither s nor t divides n, and (t - s) | (t * s). 8
0, 0, 0, 0, 3, 1, 8, 3, 9, 9, 18, 6, 26, 22, 24, 22, 39, 23, 47, 31, 48, 54, 63, 30, 71, 71, 71, 64, 90, 60, 104, 82, 103, 109, 111, 74, 134, 130, 132, 103, 153, 121, 167, 149, 151, 177, 186, 122, 197, 181, 202, 194, 220, 180, 224, 194, 238, 244, 253, 167, 276, 272, 258, 253 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
FORMULA
a(n) = Sum_{k=1..n} Sum_{i=1..k-1} (ceiling(n/k) - floor(n/k)) * (ceiling(n/i) - floor(n/i)) * (1 - ceiling((k*i)/(k-i)) + floor((k*i)/(k-i))).
EXAMPLE
a(7) = 8; There are 8 distinct positive integer pairs, (s,t), such that s < t < 7, where neither s nor t divides 7 and (t - s) | (t * s). They are (2,3), (2,4), (2,6), (3,4), (3,6), (4,5), (4,6) and (5,6).
MATHEMATICA
Table[Sum[Sum[(1 - Ceiling[(i*k)/(k - i)] + Floor[(i*k)/(k - i)]) (Ceiling[n/k] - Floor[n/k]) (Ceiling[n/i] - Floor[n/i]), {i, k - 1}], {k, n}], {n, 100}]
CROSSREFS
Sequence in context: A308742 A065451 A178148 * A245180 A054506 A101026
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Sep 15 2020
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 11:34 EDT 2024. Contains 371967 sequences. (Running on oeis4.)