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.

A108090 Numbers of the form (11^i)*(13^j).

Original entry on oeis.org

1, 11, 13, 121, 143, 169, 1331, 1573, 1859, 2197, 14641, 17303, 20449, 24167, 28561, 161051, 190333, 224939, 265837, 314171, 371293, 1771561, 2093663, 2474329, 2924207, 3455881, 4084223, 4826809, 19487171, 23030293, 27217619
Offset: 1

Views

Author

Douglas Winston (douglas.winston(AT)srupc.com), Jun 03 2005

Keywords

Crossrefs

Programs

  • Haskell
    import Data.Set (singleton, deleteFindMin, insert)
    a108090 n = a108090_list !! (n-1)
    a108090_list = f $ singleton (1,0,0) where
       f s = y : f (insert (11 * y, i + 1, j) $ insert (13 * y, i, j + 1) s')
             where ((y, i, j), s') = deleteFindMin s
    -- Reinhard Zumkeller, May 15 2015
    
  • Magma
    [n: n in [1..10^7] | PrimeDivisors(n) subset [11, 13]]; // Vincenzo Librandi, Jun 27 2016
    
  • Mathematica
    mx = 3*10^7; Sort@ Flatten@ Table[ 11^i*13^j, {i, 0, Log[11, mx]}, {j, 0, Log[13, mx/11^i]}] (* Robert G. Wilson v, Aug 17 2012 *)
    fQ[n_]:=PowerMod[143, n, n] == 0; Select[Range[2 10^7], fQ] (* Vincenzo Librandi, Jun 27 2016 *)
  • PARI
    list(lim)=my(v=List(),t); for(j=0,logint(lim\=1,13), t=13^j; while(t<=lim, listput(v,t); t*=11)); Set(v) \\ Charles R Greathouse IV, Aug 29 2016
    
  • Python
    from sympy import integer_log
    def A108090(n):
        def bisection(f,kmin=0,kmax=1):
            while f(kmax) > kmax: kmax <<= 1
            kmin = kmax >> 1
            while kmax-kmin > 1:
                kmid = kmax+kmin>>1
                if f(kmid) <= kmid:
                    kmax = kmid
                else:
                    kmin = kmid
            return kmax
        def f(x): return n+x-sum(integer_log(x//13**i,11)[0]+1 for i in range(integer_log(x,13)[0]+1))
        return bisection(f,n,n) # Chai Wah Wu, Mar 25 2025

Formula

Sum_{n>=1} 1/a(n) = (11*13)/((11-1)*(13-1)) = 143/120. - Amiram Eldar, Sep 23 2020
a(n) ~ exp(sqrt(2*log(11)*log(13)*n)) / sqrt(143). - Vaclav Kotesovec, Sep 23 2020