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 A269249 #13 Dec 13 2016 20:34:56 %S A269249 0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,1,1,0,1,0,1,0,0,0,0,0,1,1,1,0,2,0,1, %T A269249 1,0,0,0,0,2,0,1,0,1,0,1,1,0,1,1,0,0,0,0,0,0,0,1,1,1,0,1,0,0,0,0,1,0, %U A269249 0,1,0,1,0,1,0,0,1,0,0,2,0,0,0,0,1,0,0,0,0,2,1,0,0,0,0,0,0,1,2,3,0 %N A269249 Number of times the digit 9 appears in the decimal expansion of n^3. %C A269249 The cubes corresponding to the first occurrence of 1, 2, 3, ... are listed in A036535, i.e., A036535(n)^(1/3) = A048374(n) is the index of the first occurrence of n. %H A269249 G. C. Greubel, <a href="/A269249/b269249.txt">Table of n, a(n) for n = 0..1000</a> %e A269249 0^3 = 0, 1^3 = 1, 2^3 = 8, 3^3 = 27, 4^3 = 64, ... and 8^3 = 512 all have a(0) = a(1) = ... = a(8) = 0 digits '9'. %e A269249 9^3 = 729 has a(9) = 1 digit '9'. %t A269249 DigitCount[(Range[0, 100])^3, 10, 9] (* _G. C. Greubel_, Dec 13 2016 *) %o A269249 (PARI) A269249(n)=#select(t->t==9,digits(n^3)) %Y A269249 Cf. A036536 and A036527 - A036535; A048374 and A048365 - A048373. %Y A269249 Analog for the other digits 0, 1, ..., 8: A269250, A269241, A269242, A269243, A269244, A269245, A269246, A269247, A269248. %Y A269249 Analog for squares: A086017 (digit 9) and A086008 - A086016 for digits 0 - 8. %K A269249 nonn,base %O A269249 0,32 %A A269249 _M. F. Hasler_, Feb 20 2016