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.
%I A025633 #17 Jul 06 2025 10:20:26
%S A025633 1,8,9,64,72,81,512,576,648,729,4096,4608,5184,5832,6561,32768,36864,
%T A025633 41472,46656,52488,59049,262144,294912,331776,373248,419904,472392,
%U A025633 531441,2097152,2359296,2654208,2985984,3359232,3779136,4251528,4782969
%N A025633 Numbers of form 8^i*9^j, with i, j >= 0.
%H A025633 Amiram Eldar, <a href="/A025633/b025633.txt">Table of n, a(n) for n = 1..10000</a>
%F A025633 Sum_{n>=1} 1/a(n) = (8*9)/((8-1)*(9-1)) = 9/7. - _Amiram Eldar_, Sep 25 2020
%F A025633 a(n) ~ exp(sqrt(2*log(8)*log(9)*n)) / sqrt(72). - _Vaclav Kotesovec_, Sep 25 2020
%F A025633 a(n) = 8^A025676(n) * 9^A025682(n). - _R. J. Mathar_, Jul 06 2025
%t A025633 n = 10^6; Flatten[Table[8^i*9^j, {i, 0, Log[8, n]}, {j, 0, Log[9, n/8^i]}]] // Sort (* _Amiram Eldar_, Sep 25 2020 *)
%o A025633 (PARI) list(lim)=my(v=List(), N); for(n=0, logint(lim\=1, 9), N=9^n; while(N<=lim, listput(v, N); N<<=3)); Set(v) \\ _Charles R Greathouse IV_, Jan 10 2018
%Y A025633 Subsequence of A025611 and A025615.
%K A025633 easy,nonn
%O A025633 1,2
%A A025633 _David W. Wilson_