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-2 of 2 results.

A365748 a(n) = A365742(10^n).

Original entry on oeis.org

1, 3, 10, 30, 72, 247, 937, 2844, 9261, 30742
Offset: 0

Views

Author

Chai Wah Wu, Sep 17 2023

Keywords

Crossrefs

Programs

  • Python
    from collections import Counter
    from sympy import totient
    def A365748(n): return max(Counter(totient(i) for i in range(1,10**n+1)).values())

Formula

Baker and Harman showed that a(n) >= 10^(0.7038n) for all large enough n. - Chai Wah Wu, Oct 17 2023

A365741 a(n) = A365740(10^n).

Original entry on oeis.org

1, 5, 31, 189, 1261, 9595, 77681, 654249, 5650472
Offset: 0

Views

Author

Chai Wah Wu, Sep 17 2023

Keywords

Comments

Pollack et al. listed a(4)-a(6).

Crossrefs

Programs

  • Python
    from bisect import bisect
    from sympy import totient
    def A365741(n):
        k = 10**n
        plist = tuple(totient(i) for i in range(1,k+1) if not isprime(i))
        m = len(plist)
        qlist, c = [0]*(m+1), 0
        for i in range(m):
            qlist[a:=bisect(qlist,plist[i],lo=1,hi=c+1,key=lambda x:plist[x])]=i
            c = max(c,a)
        return c
Showing 1-2 of 2 results.