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 A176770 #9 Apr 04 2024 04:01:09
%S A176770 161051,1,121,1331,14641,161051,14641,1771561,19487171,19487171,
%T A176770 161051,11,121,1331,14641,1771561,161051,1771561,
%U A176770 9849732675807611094711841,19487171,672749994932560009201,121,34522712143931,2357947691,25937424601
%N A176770 Smallest power of 11 whose decimal expansion contains n.
%C A176770 This is to 11 as A176763 is to 3 and as A030001 is to 2.
%H A176770 Paolo Xausa, <a href="/A176770/b176770.txt">Table of n, a(n) for n = 0..10000</a>
%F A176770 a(n) = MIN{A001020(i) such that n in decimal representation is a substring of A001020(i)}.
%e A176770 a(1) = 1 because 11^0 = 1 has "1" as a substring (not a proper substring, though).
%e A176770 a(2) = 121 because 11^2 = 121 has "2" as a substring.
%e A176770 a(3) = 1331 because 11^3 = 1331 has "3" as a substring.
%t A176770 A176770[n_] := Block[{k = -1}, While[StringFreeQ[IntegerString[11^++k], IntegerString[n]]]; 11^k]; Array[A176770, 50, 0] (* _Paolo Xausa_, Apr 04 2024 *)
%Y A176770 Cf. A001018, A030001, A176763, A176764-A176773.
%K A176770 base,easy,nonn
%O A176770 0,1
%A A176770 _Jonathan Vos Post_, Apr 25 2010
%E A176770 More terms from _Sean A. Irvine_ and _Jon E. Schoenfield_, May 05 2010
%E A176770 a(0) prepended by _Paolo Xausa_, Apr 04 2024