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 A025634 #15 Jul 06 2025 10:20:42
%S A025634 1,8,10,64,80,100,512,640,800,1000,4096,5120,6400,8000,10000,32768,
%T A025634 40960,51200,64000,80000,100000,262144,327680,409600,512000,640000,
%U A025634 800000,1000000,2097152,2621440,3276800,4096000,5120000,6400000,8000000
%N A025634 Numbers of form 8^i*10^j, with i, j >= 0.
%H A025634 Amiram Eldar, <a href="/A025634/b025634.txt">Table of n, a(n) for n = 1..10000</a>
%F A025634 Sum_{n>=1} 1/a(n) = (8*10)/((8-1)*(10-1)) = 80/63. - _Amiram Eldar_, Sep 26 2020
%F A025634 a(n) ~ exp(sqrt(2*log(8)*log(10)*n)) / sqrt(80). - _Vaclav Kotesovec_, Sep 26 2020
%F A025634 a(n) = 8^A025677(n) *10^A025690(n). - _R. J. Mathar_, Jul 06 2025
%t A025634 n = 10^6; Flatten[Table[8^i*10^j, {i, 0, Log[8, n]}, {j, 0, Log10[n/8^i]}]] // Sort (* _Amiram Eldar_, Sep 26 2020 *)
%o A025634 (PARI) list(lim)=my(v=List(), N); for(n=0, logint(lim\=1, 10), N=10^n; while(N<=lim, listput(v, N); N<<=3)); Set(v) \\ _Charles R Greathouse IV_, Jan 10 2018
%Y A025634 Subsequence of A025612.
%K A025634 easy,nonn
%O A025634 1,2
%A A025634 _David W. Wilson_