|
%I M0588 #81 Feb 09 2024 10:07:40
%S 1,2,3,4,8,9,16,27,32,64,81,128,243,256,512,729,1024,2048,2187,4096,
%T 6561,8192,16384,19683,32768,59049,65536,131072,177147,262144,524288,
%U 531441,1048576,1594323,2097152,4194304,4782969,8388608,14348907,16777216,33554432
%N Numbers of the form 2^i or 3^j.
%C Complement of A033845 with respect to A003586. - _Reinhard Zumkeller_, Sep 25 2008
%C In the 14th century, Levi Ben Gerson proved that the only pairs of terms which differ by 1 are (1, 2), (2, 3), (3, 4), and (8, 9); see A235365, A235366, A236210. - _Jonathan Sondow_, Jan 20 2014
%C Numbers n such that absolute value of the greatest prime factor of n minus the smallest prime not dividing n is 1 (that is, abs(A006530(n)-A053669(n)) = 1). - _Anthony Browne_, Jun 26 2016
%C Deficient 3-smooth numbers, i.e., intersection of A005100 and A003586. - _Amiram Eldar_, Jun 03 2022
%D G. H. Hardy, Ramanujan, Cambridge Univ. Press, 1940, p. 78.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H T. D. Noe, <a href="/A006899/b006899.txt">Table of n, a(n) for n = 1..500</a>
%H Boris Alexeev, <a href="https://arxiv.org/abs/cs/0309052">Minimal DFAs for testing divisibility</a>, arXiv:cs/0309052 [cs.CC], 2003.
%H Jung-Chao Ban, Wen-Guei Hu, and Song-Sun Lin, <a href="http://arxiv.org/abs/1207.7154">Pattern generation problems arising in multiplicative integer systems</a>, arXiv preprint arXiv:1207.7154 [math.DS], 2012.
%H Lukas Spiegelhofer, <a href="https://arxiv.org/abs/2105.11173">Collisions of the binary and ternary sum-of-digits functions</a>, arXiv:2105.11173 [math.NT], 2021.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PillaisTheorem.html">Pillai's Theorem</a>.
%F a(n) = A085239(n)^A085238(n). - _Reinhard Zumkeller_, Jun 22 2003
%F A086411(a(n)) = A086410(a(n)). - _Reinhard Zumkeller_, Sep 25 2008
%F A053669(a(n)) - A006530(a(n)) = (-1)^a(n) n > 1. - _Anthony Browne_, Jun 26 2016
%F Sum_{n>=1} 1/a(n) = 5/2. - _Amiram Eldar_, Jun 03 2022
%p A:={seq(2^n,n=0..63)}: B:={seq(3^n,n=0..40)}: C:=sort(convert(A union B,list)): seq(C[j],j=1..39); # _Emeric Deutsch_, Aug 03 2005
%t seqMax = 10^20; Union[2^Range[0, Floor[Log[2, seqMax]]], 3^Range[0, Floor[Log[3, seqMax]]]] (* _Stefan Steinerberger_, Apr 08 2006 *)
%o (Haskell)
%o a006899 n = a006899_list !! (n-1)
%o a006899_list = 1 : m (tail a000079_list) (tail a000244_list) where
%o m us'@(u:us) vs'@(v:vs) = if u < v then u : m us vs' else v : m us' vs
%o -- _Reinhard Zumkeller_, Oct 09 2013
%o (PARI) is(n)=n>>valuation(n,2)==1 || n==3^valuation(n,3) \\ _Charles R Greathouse IV_, Aug 29 2016
%o (PARI) upto(n) = my(res = vector(logint(n, 2) + logint(n, 3) + 1), t = 1); res[1] = 1; for(i = 2, 3, for(j = 1, logint(n, i), t++; res[t] = i^j)); vecsort(res) \\ _David A. Corneth_, Oct 26 2017
%o (PARI) a(n) = my(i0= logint(3^(n-1),6), i= logint(3^n,6)); if(i > i0, 2^i, my(j=logint(2^n,6)); 3^j) \\ _Ruud H.G. van Tol_, Nov 10 2022
%Y Union of A000079 and A000244. - _Reinhard Zumkeller_, Sep 25 2008
%Y Cf. A085238, A085239.
%Y Cf. A003586, A005100, A006530, A053669.
%Y Cf. A170803, A235365, A235366, A236210.
%Y A186927 and A186928 are subsequences.
%Y Cf. A108906 (first differences), A006895, A227928.
%K nonn,easy,nice
%O 1,2
%A _Simon Plouffe_ and _N. J. A. Sloane_
%E More terms from _Reinhard Zumkeller_, Jun 22 2003
|
