[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
login
Revision History for A037144 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Numbers with at most 3 prime factors (counted with multiplicity).
(history; published version)
#20 by Alois P. Heinz at Fri Aug 23 21:11:07 EDT 2024
STATUS

proposed

approved

#19 by Chai Wah Wu at Fri Aug 23 20:11:57 EDT 2024
STATUS

editing

proposed

#18 by Chai Wah Wu at Fri Aug 23 20:11:53 EDT 2024
PROG

return kmax # Chai Wah Wu, Aug 23 2024

#17 by Chai Wah Wu at Fri Aug 23 20:11:44 EDT 2024
PROG

(Python)

from math import prod, isqrt

from sympy import primerange, integer_nthroot, primepi

def A037144(n):

def g(x, a, b, c, m): yield from (((d, ) for d in enumerate(primerange(b, isqrt(x//c)+1), a)) if m==2 else (((a2, b2), )+d for a2, b2 in enumerate(primerange(b, integer_nthroot(x//c, m)[0]+1), a) for d in g(x, a2, b2, c*b2, m-1)))

def f(x): return int(n+x-2-primepi(x)-sum(sum(primepi(x//prod(c[1] for c in a))-a[-1][0] for a in g(x, 0, 1, 1, i)) for i in range(2, 4)))

kmin, kmax = 1, 2

while f(kmax) >= kmax:

kmax <<= 1

while True:

kmid = kmax+kmin>>1

if f(kmid) < kmid:

kmax = kmid

else:

kmin = kmid

if kmax-kmin <= 1:

break

return kmax # Chai Wah Wu, Aug 23 2024

STATUS

approved

editing

#16 by Charles R Greathouse IV at Thu Sep 08 08:44:52 EDT 2022
PROG

(MAGMAMagma) [ n: n in [1..86] | n eq 1 or &+[ t[2]: t in Factorization(n) ] le 3 ]; /* Klaus Brockhaus, Mar 20 2007 */

Discussion
Thu Sep 08
08:44
OEIS Server: https://oeis.org/edit/global/2944
#15 by Harvey P. Dale at Thu Oct 15 17:49:34 EDT 2015
STATUS

editing

approved

#14 by Harvey P. Dale at Thu Oct 15 17:49:25 EDT 2015
MATHEMATICA

Select[Range[100], PrimeOmega[#]<4&] (* Harvey P. Dale, Oct 15 2015 *)

STATUS

approved

editing

#13 by Charles R Greathouse IV at Mon Sep 14 11:30:08 EDT 2015
STATUS

editing

approved

#12 by Charles R Greathouse IV at Mon Sep 14 11:30:03 EDT 2015
COMMENTS

Also numbers such that exist permutations of all proper divisors only with coprime adjacent elements: A178254(a(n))>0. [From _- _Reinhard Zumkeller_, May 24 2010]

LINKS

Klaus Brockhaus, <a href="/A037144/b037144.txt">Table of n, a(n) for n = 1..10000</a>

FORMULA

a(n) ~ 2n log n/(log log n)^2. - Charles R Greathouse IV, Sep 14 2015

PROG

(PARI) is(n)=bigomega(n)<4 \\ Charles R Greathouse IV, Sep 14 2015

CROSSREFS

A037143 is a subsequence.

A037143 is a subsequence. [From Reinhard Zumkeller, May 24 2010]

STATUS

approved

editing

#11 by Russ Cox at Fri Mar 30 18:50:11 EDT 2012
COMMENTS

Complement of A033987: A001222(a(n))<=3; A117358(a(n))=1. - _Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), _, Mar 10 2006

Also numbers such that exist permutations of all proper divisors only with coprime adjacent elements: A178254(a(n))>0. [From _Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), _, May 24 2010]

CROSSREFS

A037143 is a subsequence. [From _Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), _, May 24 2010]

EXTENSIONS

More terms from _Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), _, Mar 10 2006

Discussion
Fri Mar 30
18:50
OEIS Server: https://oeis.org/edit/global/246