|
| |
|
|
A006899
|
|
Numbers of the form 2^i or 3^j.
(Formerly M0588)
|
|
17
|
|
|
|
1, 2, 3, 4, 8, 9, 16, 27, 32, 64, 81, 128, 243, 256, 512, 729, 1024, 2048, 2187, 4096, 6561, 8192, 16384, 19683, 32768, 59049, 65536, 131072, 177147, 262144, 524288, 531441, 1048576, 1594323, 2097152, 4194304, 4782969, 8388608, 14348907, 16777216, 33554432
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
a(n) = A085239(n)^A085238(n). - Reinhard Zumkeller, Jun 22 2003
Complement of A033845 with respect to A003586; A086411(a(n))=A086410(a(n)). [From Reinhard Zumkeller, Sep 25 2008]
|
|
|
REFERENCES
|
G. H. Hardy, Ramanujan, Cambridge Univ. Press, 1940, p. 78.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..500
Boris Alexeev, Minimal DFAs for testing divisibility
Jung-Chao Ban, Wen-Guei Hu, and Song-Sun Lin, Pattern generation problems arising in multiplicative integer systems, Arxiv preprint arXiv:1207.7154, 2012
Eric Weisstein's World of Mathematics, Pillai's Theorem.
|
|
|
MAPLE
|
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)
|
|
|
MATHEMATICA
|
nn = 10^20; Union[2^Range[0, Floor[Log[2, nn]]], 3^Range[0, Floor[Log[3, nn]]]] (* Stefan Steinerberger, Apr 08 2006 *)
|
|
|
CROSSREFS
|
Union of A000079 and A000244. [From Reinhard Zumkeller, Sep 25 2008]
Cf. A170803, A170803.
A186927 and A186928 are subsequences.
Sequence in context: A068317 A074311 A076382 * A078830 A026489 A126312
Adjacent sequences: A006896 A006897 A006898 * A006900 A006901 A006902
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
|
AUTHOR
|
Simon Plouffe and N. J. A. Sloane.
|
|
|
EXTENSIONS
|
More terms from Reinhard Zumkeller, Jun 22 2003
|
|
|
STATUS
|
approved
|
| |
|
|
