A003599 -id:A003599 - cp's OEIS frontend

A108687 Numbers of the form (9^i)*(11^j), with i, j >= 0.

1, 9, 11, 81, 99, 121, 729, 891, 1089, 1331, 6561, 8019, 9801, 11979, 14641, 59049, 72171, 88209, 107811, 131769, 161051, 531441, 649539, 793881, 970299, 1185921, 1449459, 1771561, 4782969, 5845851, 7144929, 8732691, 10673289, 13045131

Offset: 1

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

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Subsequence of A003597.

Cf. A025633, A025634, A107788, A107764, A003596, A107988, A003598, A003599, A108090.

import Data.Set (singleton, deleteFindMin, insert)
a108687 n = a108687_list !! (n-1)
a108687_list = f $ singleton (1,0,0) where
   f s = y : f (insert (9 * y, i + 1, j) $ insert (11 * y, i, j + 1) s')
         where ((y, i, j), s') = deleteFindMin s
-- Reinhard Zumkeller, May 15 2015

f[upto_]:=With[{max9=Floor[Log[9,upto]],max11=Floor[Log[11,upto]]}, Select[Union[Times@@{9^First[#],11^Last[#]}&/@Tuples[{Range[0, max9], Range[0, max11]}]], #<=upto&]]; f[14000000]  (* Harvey P. Dale, Mar 11 2011 *)

from sympy import integer_log
def A108687(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//11**i,9)[0]+1 for i in range(integer_log(x,11)[0]+1))
    return bisection(f,n,n) # Chai Wah Wu, Mar 25 2025

Sum_{n>=1} 1/a(n) = (9*11)/((9-1)*(11-1)) = 99/80. - Amiram Eldar, Sep 24 2020

a(n) ~ exp(sqrt(2*log(9)*log(11)*n)) / sqrt(99). - Vaclav Kotesovec, Sep 24 2020

A125581 Numbers n such that n does not divide the denominator of the n-th harmonic number nor the denominator of the n-th alternating harmonic number.

Original entry on oeis.org

77, 847, 9317, 102487, 596778, 1127357, 1193556, 6161805, 12323610, 12400927

Offset: 1

Alexander Adamchuk, Jan 03 2007

Note that a(1) = 7*11, a(2) = 7*11^2, and a(3) = 7*11^3.
Harmonic numbers are defined as H(n) = Sum_{k=1..n} 1/k = A001008(n)/A002805(n).
Alternating harmonic numbers are defined as H'(n) = Sum_{k=1..n} (-1)^(k+1)*1/k = A058313(n)/A058312(n).
Numbers n such that n does not divide the denominator of the n-th harmonic number are listed in A074791. Numbers n such that n does not divide the denominator of the n-th alternating harmonic number are listed in A121594.
This sequence is the intersection of A074791 and A121594.
Comments from Max Alekseyev, Mar 07 2007: (Start)
While A125581 indeed contains the geometric progression 7*11^n as a subsequence, it also contains other geometric progressions such as: 546*1093^n, 1092*1093^n, 1755*3511^n, 3510*3511^n and 4896*5557^n (see A126196 and A126197). It may also contain some "isolated" terms (i.e. not participating in the geometric progressions) but such terms are harder to find and at the moment I have no proof that they exist.
This is a sketch of my proof that geometric progression 7*11^n and the others mentioned above belong to A125581.
Lemma 1. H'(n) = H(n) - H([n/2]).
Lemma 2. For prime p and integer n >= p, valuation(H(n),p) >= valuation(H([n/p]),p) - 1.
Theorem. For an integer b > 1 and a prime number p such that p divides the numerators of both H(b) and H([b/2]), the geometric progression b*p^n belongs to A125581.
Proof. It is enough to show that valuation(H(b*p^n),p) > -n and valuation(H'(b*p^n), p) > -n. By Lemma 2 we have valuation(H(b*p^n), p) >= valuation(H(b), p) - n >= 1 - n > -n.
From this inequality and Lemma 1, we have valuation(H'(b*p^n), p) >= min{ valuation(H(b*p^n), p), valuation(H([b*p^n/2]), p) } >= min{ 1 - n, valuation(H([b*p^n/2]), p) }. It remains to show that valuation(H([b*p^n/2]), p) >= 1 - n.
Again by Lemma 2, we have valuation(H([b*p^n/2]), p) >= valuation(H([b/2]), p) - n >= 1 - n, which completes the proof.
It is easy to check that this Theorem holds for the aforementioned geometric progressions. (End)

Tanya Khovanova, Non Recursions.
Eric Weisstein's World of Mathematics, Harmonic Number.

Cf. A001008, A002805, A003599, A058312, A058313, A074791, A119955, A121594.

f=0; g=0; Do[g=g+1/n; f=f+(-1)^(n+1)/n; If[ !IntegerQ[Denominator[g]/n]&&!IntegerQ[Denominator[f]/n], Print[n]], {n, 1, 10000}]

More terms from Max Alekseyev, Mar 11 2007

a(8)-a(10) from Max Alekseyev, Mar 19 2007

A025635 Numbers of form 9^i*10^j, with i, j >= 0.

Original entry on oeis.org

1, 9, 10, 81, 90, 100, 729, 810, 900, 1000, 6561, 7290, 8100, 9000, 10000, 59049, 65610, 72900, 81000, 90000, 100000, 531441, 590490, 656100, 729000, 810000, 900000, 1000000, 4782969, 5314410, 5904900, 6561000, 7290000, 8100000, 9000000

Offset: 1

David W. Wilson

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A025612, A025616, A025621, A025625, A025629, A025632, A025634, A108761, A003596, A003597, A107988, A003598, A108698, A003599, A107788, A108687, A108779, A108090.

import Data.Set (singleton, deleteFindMin, insert)
a025635 n = a025635_list !! (n-1)
a025635_list = f $ singleton (1,0,0) where
   f s = y : f (insert (9 * y, i + 1, j) $ insert (10 * y, i, j + 1) s')
         where ((y, i, j), s') = deleteFindMin s
-- Reinhard Zumkeller, May 15 2015

With[{max = 10^7}, Flatten[Table[9^i*10^j, {i, 0, Log[9, max]}, {j, 0, Log[10, max/9^i]}]] // Sort] (* Amiram Eldar, Mar 29 2025 *)

list(lim)=my(v=List(), N); for(n=0, logint(lim\=1, 10), N=10^n; while(N<=lim, listput(v, N); N*=9)); Set(v) \\ Charles R Greathouse IV, Jan 10 2018

from sympy import integer_log
def A025635(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//10**i,9)[0]+1 for i in range(integer_log(x,10)[0]+1))
    return bisection(f,n,n) # Chai Wah Wu, Mar 25 2025

Sum_{n>=1} 1/a(n) = 5/4. - Amiram Eldar, Mar 29 2025

a(n) = 9^A025683(n) * 10^A025691(n). - R. J. Mathar, Jul 06 2025

A107466 Numbers of the form (5^i)*(13^j).

Original entry on oeis.org

1, 5, 13, 25, 65, 125, 169, 325, 625, 845, 1625, 2197, 3125, 4225, 8125, 10985, 15625, 21125, 28561, 40625, 54925, 78125, 105625, 142805, 203125, 274625, 371293, 390625, 528125, 714025, 1015625, 1373125, 1856465, 1953125, 2640625

Offset: 1

Douglas Winston (douglas.winston(AT)srupc.com), May 27 2005

nonn

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A003586, A003592, A003593, A003591, A003594, A003595, A003596, A003597, A003598, A003599, A107326, A107364.

mx = 2700000; Sort@ Flatten@ Table[5^i*13^j, {i, 0, Log[5, mx]}, {j, 0, Log[13, mx/5^i]}] (* Robert G. Wilson v, Aug 17 2012 *)

list(lim)=my(v=List(),N);for(n=0,log(lim)\log(13),N=13^n;while(N<=lim,listput(v,N);N*=5));vecsort(Vec(v)) \\ Charles R Greathouse IV, Jun 28 2011

from sympy import integer_log
def A107466(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,5)[0]+1 for i in range(integer_log(x,13)[0]+1))
    return bisection(f,n,n) # Chai Wah Wu, Mar 25 2025

Sum_{n>=1} 1/a(n) = (5*13)/((5-1)*(13-1)) = 65/48. - Amiram Eldar, Sep 23 2020

a(n) ~ exp(sqrt(2*log(5)*log(13)*n)) / sqrt(65). - Vaclav Kotesovec, Sep 23 2020

A108698 Numbers of the form (6^i)*(11^j), with i, j >= 0.

Original entry on oeis.org

1, 6, 11, 36, 66, 121, 216, 396, 726, 1296, 1331, 2376, 4356, 7776, 7986, 14256, 14641, 26136, 46656, 47916, 85536, 87846, 156816, 161051, 279936, 287496, 513216, 527076, 940896, 966306, 1679616, 1724976, 1771561, 3079296, 3162456

Offset: 1

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

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A025626, A025627, A025628, A025629, A064476, A107710, A003596, A003597, A107988, A003598, A108687, A003599, A107788, A108090.

import Data.Set (singleton, deleteFindMin, insert)
a108698 n = a108698_list !! (n-1)
a108698_list = f $ singleton (1,0,0) where
   f s = y : f (insert (6 * y, i + 1, j) $ insert (11 * y, i, j + 1) s')
         where ((y, i, j), s') = deleteFindMin s
-- Reinhard Zumkeller, May 15 2015

n = 10^6; Flatten[Table[6^i*11^j, {i, 0, Log[6, n]}, {j, 0, Log[11, n/6^i]}]] // Sort (* Amiram Eldar, Oct 07 2020 *)

Sum_{n>=1} 1/a(n) = (6*11)/((6-1)*(11-1)) = 33/25. - Amiram Eldar, Oct 07 2020

a(n) ~ exp(sqrt(2*log(6)*log(11)*n)) / sqrt(66). - Vaclav Kotesovec, Oct 07 2020

A108056 Numbers of the form (7^i)*(13^j).

Original entry on oeis.org

1, 7, 13, 49, 91, 169, 343, 637, 1183, 2197, 2401, 4459, 8281, 15379, 16807, 28561, 31213, 57967, 107653, 117649, 199927, 218491, 371293, 405769, 753571, 823543, 1399489, 1529437, 2599051, 2840383, 4826809, 5274997, 5764801, 9796423, 10706059, 18193357, 19882681

Offset: 1

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

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A003586, A003592, A003593, A003591, A003594, A003595, A003596, A003597, A003598, A003599, A107326, A107364, A107466.

n = 10^7; Flatten[Table[7^i*13^j, {i, 0, Log[7, n]}, {j, 0, Log[13, n/7^i]}]] // Sort (* Amiram Eldar, Sep 23 2020 *)

list(lim)=my(v=List(),N);for(n=0,log(lim)\log(13),N=13^n;while(N<=lim,listput(v,N);N*=7));vecsort(Vec(v)) \\ Charles R Greathouse IV, Jun 28 2011

from sympy import integer_log
def A108056(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: 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,7)[0]+1 for i in range(integer_log(x,13)[0]+1))
    return bisection(f,n,n) # Chai Wah Wu, Oct 22 2024

Sum_{n>=1} 1/a(n) = (7*13)/((7-1)*(13-1)) = 91/72. - Amiram Eldar, Sep 23 2020

a(n) ~ exp(sqrt(2*log(7)*log(13)*n)) / sqrt(91). - Vaclav Kotesovec, Sep 23 2020

More terms from Amiram Eldar, Sep 23 2020

A108779 Numbers of the form (10^i)*(11^j), with i, j >= 0.

Original entry on oeis.org

1, 10, 11, 100, 110, 121, 1000, 1100, 1210, 1331, 10000, 11000, 12100, 13310, 14641, 100000, 110000, 121000, 133100, 146410, 161051, 1000000, 1100000, 1210000, 1331000, 1464100, 1610510, 1771561, 10000000, 11000000, 12100000, 13310000

Offset: 1

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

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A025612, A025616, A025621, A025625, A025629, A025632, A025634, A025635, A108761, A003596, A003597, A107988, A003598, A108698, A003599, A107788, A108687, A108090.

import Data.Set (singleton, deleteFindMin, insert)
a108779 n = a108779_list !! (n-1)
a108779_list = f $ singleton (1,0,0) where
   f s = y : f (insert (10 * y, i + 1, j) $ insert (11 * y, i, j + 1) s')
         where ((y, i, j), s') = deleteFindMin s
-- Reinhard Zumkeller, May 15 2015

n = 10^7; Flatten[Table[10^i*11^j, {i, 0, Log10[n]}, {j, 0, Log[11, n/10^i]}]] // Sort (* Amiram Eldar, Sep 25 2020 *)

Sum_{n>=1} 1/a(n) = (10*11)/((10-1)*(11-1)) = 11/9. - Amiram Eldar, Sep 25 2020

a(n) ~ exp(sqrt(2*log(10)*log(11)*n)) / sqrt(110). - Vaclav Kotesovec, Sep 25 2020

A108238 Numbers of the form (7^i)*(12^j), with i, j >= 0.

Original entry on oeis.org

1, 7, 12, 49, 84, 144, 343, 588, 1008, 1728, 2401, 4116, 7056, 12096, 16807, 20736, 28812, 49392, 84672, 117649, 145152, 201684, 248832, 345744, 592704, 823543, 1016064, 1411788, 1741824, 2420208, 2985984, 4148928, 5764801, 7112448

Offset: 1

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

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A036566, A025631, A025632, A003599, A108056, A108201, A064476.

Take[7^#[[1]]*12^#[[2]]&/@Tuples[Range[0,10],2]//Union,40] (* Harvey P. Dale, Mar 05 2017 *)
n = 10^6; Flatten[Table[7^i*12^j, {i, 0, Log[7, n]}, {j, 0, Log[12, n/7^i]}]] // Sort (* Amiram Eldar, Sep 26 2020 *)

from sympy import integer_log
def A108238(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//12**i,7)[0]+1 for i in range(integer_log(x,12)[0]+1))
    return bisection(f,n,n) # Chai Wah Wu, Mar 26 2025

Sum_{n>=1} 1/a(n) = (7*12)/((7-1)*(12-1)) = 14/11. - Amiram Eldar, Sep 26 2020

a(n) ~ exp(sqrt(2*log(7)*log(12)*n)) / sqrt(84). - Vaclav Kotesovec, Sep 26 2020

A036307 Composite numbers whose prime factors contain no digits other than 1 and 7.

Original entry on oeis.org

49, 77, 119, 121, 187, 289, 343, 497, 539, 781, 833, 847, 1207, 1309, 1331, 2023, 2057, 2401, 3179, 3479, 3773, 4913, 5041, 5467, 5831, 5929, 7819, 8197, 8449, 8591, 9163, 9317, 12287, 12439, 12881, 13277, 14161, 14399, 14641, 16807, 18989, 19547

Offset: 1

Patrick De Geest, Dec 15 1998

All terms are a product of at least two terms of A020455. - David A. Corneth, Oct 09 2020

David A. Corneth, Table of n, a(n) for n = 1..10000 (first 1000 terms from Alois P. Heinz)
Index entries for sequences related to prime factors.

Cf. A003599, A020455, A036302-A036325.

Sum_{n>=1} 1/a(n) = Product_{p in A020455} (p/(p - 1)) - Sum_{p in A020455} 1/p - 1 = 0.0775663737... . - Amiram Eldar, May 18 2022

A108218 Numbers of the form (11^i)*(12^j), with i, j >= 0.

Original entry on oeis.org

1, 11, 12, 121, 132, 144, 1331, 1452, 1584, 1728, 14641, 15972, 17424, 19008, 20736, 161051, 175692, 191664, 209088, 228096, 248832, 1771561, 1932612, 2108304, 2299968, 2509056, 2737152, 2985984, 19487171, 21258732, 23191344, 25299648

Offset: 1

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

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A003596, A003597, A107988, A003598, A108201, A108698, A064476, A003599, A108238, A107788, A108687, A108779, A108090, A108771.

import Data.Set (singleton, deleteFindMin, insert)
a108218 n = a108218_list !! (n-1)
a108218_list = f $ singleton (1,0,0) where
   f s = y : f (insert (11 * y, i + 1, j) $ insert (12 * y, i, j + 1) s')
         where ((y, i, j), s') = deleteFindMin s
-- Reinhard Zumkeller, May 15 2015

With[{max = 3*10^7}, Flatten[Table[11^i*12^j, {i, 0, Log[11, max]}, {j, 0, Log[12, max/11^i]}]] // Sort] (* Amiram Eldar, Mar 29 2025 *)

Sum_{n>=1} 1/a(n) = 6/5. - Amiram Eldar, Mar 29 2025

cp's OEIS Frontend

A108687 Numbers of the form (9^i)*(11^j), with i, j >= 0.

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

Mathematica

Python

Formula

A125581 Numbers n such that n does not divide the denominator of the n-th harmonic number nor the denominator of the n-th alternating harmonic number.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions

A025635 Numbers of form 9^i*10^j, with i, j >= 0.

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Python

Formula

A107466 Numbers of the form (5^i)*(13^j).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A108698 Numbers of the form (6^i)*(11^j), with i, j >= 0.

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A108056 Numbers of the form (7^i)*(13^j).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

A108779 Numbers of the form (10^i)*(11^j), with i, j >= 0.

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A108238 Numbers of the form (7^i)*(12^j), with i, j >= 0.

Views

Author