This site is supported by donations to The OEIS Foundation.

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064951 Sum of LCM(x, y) for 1 <= x, y <= n. 2
 1, 7, 28, 72, 177, 303, 604, 948, 1497, 2127, 3348, 4272, 6313, 8119, 10324, 13060, 17701, 20995, 27512, 32132, 38453, 45779, 57440, 64664, 77689, 89935, 104704, 117948, 141525, 154755, 183616, 205472, 231113, 258959, 290564, 314720, 364041 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) is also the entrywise 1-norm of the n*n LCM matrix LINKS Harry J. Smith, Table of n, a(n) for n = 1..1000 FORMULA a(n) = a(n-1)+2*A051193(n)-n = a(n-1)+n*A057660(n) = sum_i, j{1<= i<= j<= n}[j^2/gcd(i, j)]. - Henry Bottomley, Oct 29 2001 MATHEMATICA Table[nn = n; Total[Level[Table[Table[LCM[i, j], {i, 1, nn}], {j, 1, nn}], {2}]], {n, 1, 37}] (* Geoffrey Critzer, Jan 14 2015 *) PROG (PARI) { a=0; for (n=1, 1000, a+=n*sum(k=1, n, n/gcd(n, k)); write("b064951.txt", n, " ", a) ) } [From Harry J. Smith, Oct 01 2009] CROSSREFS Cf. A018806. Sequence in context: A008457 A138503 A223765 * A211899 A073995 A061968 Adjacent sequences:  A064948 A064949 A064950 * A064952 A064953 A064954 KEYWORD nonn AUTHOR Vladeta Jovovic, Oct 28 2001 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.