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.

Showing 1-5 of 5 results.

A071520 Number of 5-smooth numbers (A051037) <= n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 6, 7, 8, 9, 9, 10, 10, 10, 11, 12, 12, 13, 13, 14, 14, 14, 14, 15, 16, 16, 17, 17, 17, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 21, 22, 22, 22, 23, 23, 24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 28, 28
Offset: 1

Views

Author

Benoit Cloitre, Jun 02 2002

Keywords

Comments

A 5-smooth number is a number of the form 2^x*3^y*5^z (x,y,z) >= 0.

Links

Crossrefs

Cf. A008683, A051037, A106598, A112751.
Number of p-smooth numbers <= n: A070939 (p=2), A071521 (p=3), this sequence (p=5), A071604 (p=7), A071523 (p=11), A080684 (p=13), A080685 (p=17), A080686 (p=19).

Programs

  • Mathematica
    Accumulate[Table[If[Max[FactorInteger[n][[;;,1]]]<6,1,0],{n,80}]] (* Harvey P. Dale, Aug 04 2024 *)
  • PARI
    for(n=1,100,print1(sum(k=1,n,if(sum(i=4,n,if(k%prime(i),0,1)),0,1)),","))
  • PARI
    a(n)=-sum(k=1,n,moebius(2*3*5*k)*floor(n/k)) \\ Benoit Cloitre, Jun 14 2007
  • Python
    from sympy import integer_log
def A071520(n):
    c = 0
    for i in range(integer_log(n,5)[0]+1):
        for j in range(integer_log(m:=n//5**i,3)[0]+1):
            c += (m//3**j).bit_length()
    return c # Chai Wah Wu, Sep 16 2024

Formula

a(n) = Card{ k | A051037(k) <= n }.
Asymptotically : let a = 1/(6*log(2)*log(3)*log(5)) and b = sqrt(30) then a(n) = a*log(b*n)^3 + O(log(n)).
a(n) = -Sum_{k=1,n} mu(30*k)*floor(n/k). - Benoit Cloitre, Jun 14 2007
a(n) = Sum_{i=0..floor(log_5(n))} Sum_{j=0..floor(log_3(n/5^i))} floor(log_2(2*n/(5^i*3^j))). - Ridouane Oudra, Jul 17 2020

Extensions

Title corrected by Rainer Rosenthal, Aug 30 2020

A071604 a(n) is the number of 7-smooth numbers <= n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 11, 11, 12, 13, 14, 14, 15, 15, 16, 17, 17, 17, 18, 19, 19, 20, 21, 21, 22, 22, 23, 23, 23, 24, 25, 25, 25, 25, 26, 26, 27, 27, 27, 28, 28, 28, 29, 30, 31, 31, 31, 31, 32, 32, 33, 33, 33, 33, 34, 34, 34, 35, 36, 36, 36, 36, 36, 36, 37, 37, 38
Offset: 1

Views

Author

Benoit Cloitre, Jun 02 2002

Keywords

Comments

A 7-smooth number is a number of the form 2^x*3^y*5^z*7^u, (x,y,z,u) >= 0.
In other words, a 7-smooth number is a number with no prime factor greater than 7. - Peter Munn, Nov 20 2021

Examples

			a(11) = 10 as there are 10 7-smooth numbers <= 11. Namely 1, 2, 3, 4, 5, 6, 7, 8, 9, 10. - _David A. Corneth_, Apr 19 2021

Links

Crossrefs

Partial sums of A086299.
Column 7 of A080786.
Cf. A002473, A106600, A343598.
Equivalent sequences with other limits on greatest prime factor: A070939 (2), A071521 (3), A071520 (5), A071523 (11), A080684 (13), A080685 (17), A080686 (19), A096300 (log n).

Programs

  • PARI
    for(n=1,100,print1(sum(k=1,n,if(sum(i=5,n,if(k%prime(i),0,1)),0,1)),","))
  • Python
    from sympy import integer_log
def A071604(n):
    c = 0
    for i in range(integer_log(n,7)[0]+1):
        i7 = 7**i
        m = n//i7
        for j in range(integer_log(m,5)[0]+1):
            j5 = 5**j
            r = m//j5
            for k in range(integer_log(r,3)[0]+1):
                c += (r//3**k).bit_length()
    return c # Chai Wah Wu, Sep 16 2024

Formula

a(n) = Card{ k | A002473 (k) <= n }.

Extensions

Name corrected by David A. Corneth, Apr 19 2021

A080686 Number of 19-smooth numbers <= n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 22, 23, 24, 25, 26, 27, 27, 28, 28, 29, 30, 31, 32, 33, 33, 34, 35, 36, 36, 37, 37, 38, 39, 39, 39, 40, 41, 42, 43, 44, 44, 45, 46, 47, 48, 48, 48, 49, 49, 49, 50, 51, 52, 53, 53, 54, 54, 55, 55, 56
Offset: 1

Views

Author

Cino Hilliard, Mar 02 2003

Keywords

Comments

Range = primes 2 to 19. Input pn=19 in script below. Code below is much faster than the code for cross-reference. For input of n=200 13 times as fast and many times faster for larger input of n.

Links

Crossrefs

Cf. A080682.
Number of p-smooth numbers <= n: A070939 (p=2), A071521 (p=3), A071520 (p=5), A071604 (p=7), A071523 (p=11), A080684 (p=13), A080685 (p=17), this sequence (p=19).

Programs

  • Mathematica
    Accumulate[Table[Boole[Max[FactorInteger[n][[;; , 1]]] <= 19], {n, 100}]] (* Amiram Eldar, Apr 29 2025 *)
  • PARI
    smoothn(n,pn) = { for(m=1,n, pr=1; forprime(p=2,pn, pr*=p; ); ct=1; for(x=1,m, f=0; forprime(y=nextprime(pn+1),floor(x), if(x%y == 0,f=1; break) ); if(gcd(x,pr)<>1,if(f==0,ct+=1; )) ); print1(ct","); ) }
  • Python
    from sympy import integer_log, prevprime
def A080686(n):
    def g(x,m): return sum((x//3**i).bit_length() for i in range(integer_log(x,3)[0]+1)) if m==3 else sum(g(x//(m**i),prevprime(m))for i in range(integer_log(x,m)[0]+1))
    return g(n,19) # Chai Wah Wu, Sep 17 2024

A071523 Number of 11-smooth numbers <= n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 12, 13, 14, 15, 15, 16, 16, 17, 18, 19, 19, 20, 21, 21, 22, 23, 23, 24, 24, 25, 26, 26, 27, 28, 28, 28, 28, 29, 29, 30, 30, 31, 32, 32, 32, 33, 34, 35, 35, 35, 35, 36, 37, 38, 38, 38, 38, 39, 39, 39, 40, 41, 41, 42, 42, 42, 42, 43, 43, 44
Offset: 1

Views

Author

Benoit Cloitre, Jun 02 2002

Keywords

Comments

An 11-smooth number is a number of the form 2^x*3^y*5^z*7^u*11^v (x,y,z,u,v) >= 0.

Links

Crossrefs

Cf. A051038.
Number of p-smooth numbers <= n: A070939 (p=2), A071521 (p=3), A071520 (p=5), A071604 (p=7), this sequence (p=11), A080684 (p=13), A080685 (p=17), A080686 (p=19).

Programs

  • Mathematica
    Accumulate[Table[If[Max[FactorInteger[n][[;;,1]]]<=11,1,0],{n,120}]] (* Harvey P. Dale, Sep 02 2024 *)
  • PARI
    a(n)=sum(k=1,n,(k<4) || 13>vecmax(factor(k)~[1,]))

Formula

a(n) = Card{ k | A051038(k) <= n }.

A080685 Number of 17-smooth numbers <= n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 18, 19, 20, 21, 21, 22, 23, 24, 25, 26, 26, 27, 27, 28, 29, 30, 31, 32, 32, 32, 33, 34, 34, 35, 35, 36, 37, 37, 37, 38, 39, 40, 41, 42, 42, 43, 44, 45, 45, 45, 45, 46, 46, 46, 47, 48, 49, 50, 50, 51, 51, 52, 52, 53
Offset: 1

Views

Author

Cino Hilliard, Mar 02 2003

Keywords

Comments

Range = primes 2 to 17. Input pn=17 in script below. Code below is much faster than the code for cross-reference. For input of n=200 13 times as fast and many times faster for larger input of n.

Links

Crossrefs

Cf. A080681.
Number of p-smooth numbers <= n: A070939 (p=2), A071521 (p=3), A071520 (p=5), A071604 (p=7), A071523 (p=11), A080684 (p=13), this sequence (p=17), A080686 (p=19).

Programs

  • Mathematica
    Accumulate[Table[Boole[Max[FactorInteger[n][[;; , 1]]] <= 17], {n, 100}]] (* Amiram Eldar, Apr 29 2025 *)
  • PARI
    smoothn(n,pn) = { for(m=1,n, pr=1; forprime(p=2,pn, pr*=p; ); ct=1; for(x=1,m, f=0; forprime(y=nextprime(pn+1),floor(x), if(x%y == 0,f=1; break) ); if(gcd(x,pr)<>1,if(f==0,ct+=1; )) ); print1(ct","); ) }
Showing 1-5 of 5 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.