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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A339026 Number of pairs (x,y): 1 <= x < y <= n*n, such that x*y is a square. 2
 0, 1, 4, 8, 16, 27, 40, 58, 80, 105, 128, 158, 198, 237, 278, 336, 382, 435, 502, 574, 632, 699, 798, 868, 968, 1063, 1176, 1262, 1362, 1505, 1590, 1732, 1880, 2007, 2150, 2272, 2434, 2567, 2746, 2930, 3062, 3265, 3444, 3654, 3832, 4035, 4284, 4454, 4668, 4875, 5142, 5364, 5590, 5889, 6078, 6336, 6614, 6881, 7166 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Edward Krogius, Table of n, a(n) for n = 1..1000 Edward Krogius, Illustration of 105 solutions in 100x100 grid FORMULA a(n) = Sum_{j=2..n} phi(j) * floor(n^2/j^2). a(n) = (A338894(n) - n^2)/2. a(n) = A132189(n^2)/2. - Antti Karttunen, Nov 23 2020 EXAMPLE For n = 3, we have the following solutions: (1,4), (1,9), (2,8), (4,9), therefore a(3) = 4. For n = 4, we have the following solutions: (1,4), (1,9), (1,16), (2,8), (3,12), (4,9), (4,16), (9,16), therefore a(4) = 8. MATHEMATICA Array[Sum[EulerPhi[j] Floor[(#^2)/(j^2)], {j, 2, #}] &, 59] (* Michael De Vlieger, Dec 11 2020 *) PROG (PARI) A339026(n) = sum(i=2, n, floor(n^2/i^2)*eulerphi(i)); \\ Antti Karttunen, Nov 23 2020 CROSSREFS Cf. A000010, A015614, A018805, A132188, A132189, A132345, A338894. Sequence in context: A257279 A334151 A299894 * A025197 A008371 A334198 Adjacent sequences:  A339023 A339024 A339025 * A339027 A339028 A339029 KEYWORD nonn AUTHOR Edward Krogius, Nov 19 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.

Last modified August 9 18:55 EDT 2022. Contains 356026 sequences. (Running on oeis4.)