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 A025629 #14 Jul 06 2025 10:18:35
%S A025629 1,6,10,36,60,100,216,360,600,1000,1296,2160,3600,6000,7776,10000,
%T A025629 12960,21600,36000,46656,60000,77760,100000,129600,216000,279936,
%U A025629 360000,466560,600000,777600,1000000,1296000,1679616,2160000,2799360,3600000,4665600
%N A025629 Numbers of form 6^i*10^j with i, j >= 0.
%H A025629 Amiram Eldar, <a href="/A025629/b025629.txt">Table of n, a(n) for n = 1..10000</a>
%F A025629 Sum_{n>=1} 1/a(n) = (6*10)/((6-1)*(10-1)) = 4/3. - _Amiram Eldar_, Sep 26 2020
%F A025629 a(n) ~ exp(sqrt(2*log(6)*log(10)*n)) / sqrt(60). - _Vaclav Kotesovec_, Sep 26 2020
%F A025629 a(n) = 6^A025663(n) * 10^A025688(n). - _R. J. Mathar_, Jul 06 2025
%t A025629 n = 10^6; Flatten[Table[6^i*10^j, {i, 0, Log[6, n]}, {j, 0, Log10[n/6^i]}]] // Sort (* _Amiram Eldar_, Sep 26 2020 *)
%o A025629 (PARI) list(lim)=my(v=List(), N); for(n=0, logint(lim\=1, 10), N=10^n; while(N<=lim, listput(v, N); N*=6)); Set(v) \\ _Charles R Greathouse IV_, Jan 10 2018
%Y A025629 Cf. A025610, A025618, A025622, A025626, A025627, A025628.
%Y A025629 Cf. A025612, A025616, A025621, A025625, A025632, A025634.
%K A025629 easy,nonn
%O A025629 1,2
%A A025629 _David W. Wilson_