The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A344711 a(n) = Sum_{k=1..n} (A000330(n) mod k^2). 1
0, 1, 7, 19, 16, 50, 106, 66, 174, 233, 144, 210, 501, 277, 504, 965, 984, 893, 1566, 1946, 1691, 2224, 2586, 1694, 2713, 2992, 2205, 4055, 4778, 4726, 4700, 7142, 6655, 6785, 7270, 7949, 8169, 8742, 10218, 8874, 11375, 15885, 14264, 16933, 17925, 20622, 17529, 20599, 21695, 18830, 21992, 24273 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Squares in this sequence include a(1) = 0, a(2) = 1, a(5) = 16 and a(11) = 144. Are there any others?
LINKS
EXAMPLE
A000330(4) = 1^2 + 2^2 + 3^2 + 4^2 = 30 so a(4) = (30 mod 1^2) + (30 mod 2^2) + (30 mod 3^2) + (30 mod 4^2) = 19.
MAPLE
f:= proc(n) local M, k;
M:= n*(n+1)*(2*n+1)/6;
add(M mod k^2, k=1..n)
end proc:
map(f, [$1..100]);
CROSSREFS
Cf. A000330.
Sequence in context: A195870 A125257 A195867 * A052256 A064819 A281915
KEYWORD
nonn
AUTHOR
J. M. Bergot and Robert Israel, May 26 2021
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 June 8 07:10 EDT 2024. Contains 373207 sequences. (Running on oeis4.)