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!)
A066377 Number of numbers m <= n such that floor(sqrt(m)) divides m. 2

%I #13 Jun 15 2018 21:29:21

%S 1,3,6,10,16,24,33,45,60,76,96,120,145,175,210,246,288,336,385,441,

%T 504,568,640,720,801,891,990,1090,1200,1320,1441,1573,1716,1860,2016,

%U 2184,2353,2535,2730,2926,3136,3360,3585,3825,4080,4336

%N Number of numbers m <= n such that floor(sqrt(m)) divides m.

%H Harry J. Smith, <a href="/A066377/b066377.txt">Table of n, a(n) for n = 1..1000</a>

%F Empirical g.f.: -x*(x^3-x^2-x-1) / ((x-1)^4*(x^2+x+1)^2). [_Colin Barker_, Jan 12 2013]

%o (PARI) { n=0; a=0; for (m=1, 10^9, if (m%floor(sqrt(m)) == 0, a+=m; write("b066377.txt", n++, " ", a); if (n==1000, return)) ) } \\ _Harry J. Smith_, Feb 12 2010

%Y Partial sums of A006446.

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Dec 23 2001

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 28 16:39 EDT 2024. Contains 372091 sequences. (Running on oeis4.)