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!)
A211264 Number of integer pairs (x,y) such that 0 < x < y <= n and x*y <= n. 10

%I #25 Sep 08 2022 08:46:02

%S 0,1,2,3,4,6,7,9,10,12,13,16,17,19,21,23,24,27,28,31,33,35,36,40,41,

%T 43,45,48,49,53,54,57,59,61,63,67,68,70,72,76,77,81,82,85,88,90,91,96,

%U 97,100,102,105,106,110,112,116,118,120,121,127,128,130,133,136

%N Number of integer pairs (x,y) such that 0 < x < y <= n and x*y <= n.

%C Partial sums of A056924.

%C For a guide to related sequences, see A211266.

%H Robert Israel, <a href="/A211264/b211264.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = (1/2)*Sum_{i=1..n} (1 - A008836(i))*floor(n/i). - _Enrique PĂ©rez Herrero_, Jul 10 2012 [Corrected by _Ridouane Oudra_, Oct 17 2019]

%F From _Ridouane Oudra_, Oct 17 2019: (Start)

%F a(n) = Sum_{i=1..n} (A001222(i) mod 2)*floor(n/i)

%F a(n) = (1/2)*(A006218(n) - A000196(n)). (End)

%p with(numtheory): seq(add((bigomega(i) mod 2)*floor(n/i), i=1..n), n=1..60); # _Ridouane Oudra_, Oct 17 2019

%p # Alternative:

%p ListTools:-PartialSums(map(t-> floor(numtheory:-tau(t)/2), [$1..100])); # _Robert Israel_, Oct 18 2019

%t a = 1; b = n; z1 = 120;

%t t[n_] := t[n] = Flatten[Table[x*y, {x, a, b - 1},

%t {y, x + 1, b}]]

%t c[n_, k_] := c[n, k] = Count[t[n], k]

%t Table[c[n, n], {n, 1, z1}] (* A056924 *)

%t Table[c[n, n + 1], {n, 1, z1}] (* A211159 *)

%t Table[c[n, 2*n], {n, 1, z1}] (* A211261 *)

%t Table[c[n, 3*n], {n, 1, z1}] (* A211262 *)

%t Table[c[n, Floor[n/2]], {n, 1, z1}] (* A211263 *)

%t Print

%t c1[n_, m_] := c1[n, m] = Sum[c[n, k], {k, a, m}]

%t Table[c1[n, n], {n, 1, z1}] (* A211264 *)

%t Table[c1[n, n + 1], {n, 1, z1}] (* A211265 *)

%t Table[c1[n, 2*n], {n, 1, z1}] (* A211266 *)

%t Table[c1[n, 3*n], {n, 1, z1}] (* A211267 *)

%t Table[c1[n, Floor[n/2]], {n, 1, z1}] (* A181972 *)

%o (Magma) [0] cat [&+[(&+[p[2]: p in Factorization(i)] mod 2) *Floor(n div i):i in [2..n] ]:n in [2..65]]; // _Marius A. Burtea_, Oct 17 2019

%o (Python)

%o from math import isqrt

%o def A211264(n): return (lambda m: sum(n//k for k in range(1, m+1))-m*(m+1)//2)(isqrt(n)) # _Chai Wah Wu_, Oct 08 2021

%Y Cf. A211266, A001222, A006218, A000196.

%K nonn

%O 1,3

%A _Clark Kimberling_, Apr 06 2012

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 August 12 23:54 EDT 2024. Contains 375113 sequences. (Running on oeis4.)