cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A066377 #15 Mar 14 2025 08:29:47
%S A066377 1,3,6,10,16,24,33,45,60,76,96,120,145,175,210,246,288,336,385,441,
%T A066377 504,568,640,720,801,891,990,1090,1200,1320,1441,1573,1716,1860,2016,
%U A066377 2184,2353,2535,2730,2926,3136,3360,3585,3825,4080,4336
%N A066377 Number of numbers m <= n such that floor(sqrt(m)) divides m.
%H A066377 Harry J. Smith, <a href="/A066377/b066377.txt">Table of n, a(n) for n = 1..1000</a>
%H A066377 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,2,-4,2,-1,2,-1).
%F A066377 G.f.: -x*(x^3-x^2-x-1) / ((x-1)^4*(x^2+x+1)^2). - _Colin Barker_, Jan 12 2013
%o A066377 (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 A066377 Partial sums of A006446.
%K A066377 nonn
%O A066377 1,2
%A A066377 _N. J. A. Sloane_, Dec 23 2001