The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A337680 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, 9, 5, 10, 11, 22, 9, 30, 25, 27, 29, 46, 28, 55, 37, 53, 62, 73, 43, 77, 80, 78, 76, 103, 69, 115, 95, 112, 121, 121, 91, 148, 143, 144, 121, 168, 132, 180, 161, 158, 191, 202, 149, 208, 192, 215, 210, 237, 193, 237, 215, 253, 262, 273, 197, 289, 284, 264, 272 (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) = 9; There are 9 positive integer pairs, (s,t), such that s < t < 7, neither s nor t divides 7, and where (t - s) | (t + s). They are (2,3), (2,4), (2,6), (3,4), (3,5), (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 Cf. A335567, A337273, A337588, A337679, A337681, A337682, A337683, A337684. Sequence in context: A270236 A140714 A112932 * A077895 A105539 A132819 Adjacent sequences:  A337677 A337678 A337679 * A337681 A337682 A337683 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 10 15:47 EDT 2021. Contains 342845 sequences. (Running on oeis4.)