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 A034054 #26 Feb 16 2025 08:32:37
%S A034054 7,17,71,117,171,711,1117,1171,1711,7111,11117,11171,11711,17111,
%T A034054 71111,111117,111171,111711,117111,171111,711111,1111117,1111171,
%U A034054 1111711,1117111,1171111,1711111,7111111,11111117,11111171,11111711,11117111
%N A034054 Numbers with multiplicative digital root value 7.
%C A034054 Numbers with one 7, and zero or more 1s. - _Daniel Forgues_, Oct 09 2011
%H A034054 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MultiplicativeDigitalRoot.html">Multiplicative Digital Root</a>
%H A034054 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%F A034054 There are n(n+1)/2 elements up to 10^n, so a(n) is about 10^sqrt(2n).
%t A034054 Sort[Flatten[Table[FromDigits/@Permutations[Join[{7},PadRight[{},n,1]]],{n,0,10}]]] (* _Harvey P. Dale_, Jul 20 2015 *)
%o A034054 (PARI) t(k)=while(k>9, k=prod(i=1, #k=digits(k), k[i])); k
%o A034054 for(n=1, 1e8, if(t(n) == 7, print1(n, ", "))); \\ _Altug Alkan_, Oct 22 2015
%Y A034054 Cf. A031347.
%Y A034054 Cf. A034048, A002275, A034049, A034050, A034051, A034052, A034053, A034054, A034055, A034056 (numbers having multiplicative digital roots 0-9).
%K A034054 nonn,base,easy
%O A034054 1,1
%A A034054 _Patrick De Geest_, Sep 15 1998