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 A236314 #22 Feb 05 2024 09:26:38 %S A236314 1,0,0,0,1,3,0,0,1,1,2,0,0,0,0,2,1,0,2,0,2,0,0,1,2,0,0,1,0,0,2,2,2,0, %T A236314 3,1,1,0,1,0,1,1,1,0,3,1,0,1,1,1,1,2,2,1,0,1,1,0,1,3,2,0,1,1,0,2,0,0, %U A236314 0,0,1,0,1,1,2,5,2,1,2,0,3,3,2,1,0,1,0 %N A236314 Number of non-overlapping occurrences of n in the decimal representation of n^n. %H A236314 Scott R. Shannon, <a href="/A236314/b236314.txt">Table of n, a(n) for n = 1..10000</a> %e A236314 6^6 is 46656 with 3 6's, hence a(6) = 3. %t A236314 a[n_] := Length@ StringPosition[ToString[n^n], ToString[n], Overlaps -> False]; (* _Giovanni Resta_, Jan 22 2014 *) %o A236314 (Python) %o A236314 from itertools import count %o A236314 a=(str(n**n).count(str(n)) for n in count(1)) %Y A236314 A049329 lists n where a(n) is nonzero. %Y A236314 The same sequence but allowing for overlapping occurrences is at A236322. %K A236314 base,nonn,easy %O A236314 1,6 %A A236314 _Christian Perfect_, Jan 22 2014