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 A363249 #52 Dec 15 2024 00:10:35 %S A363249 1,9,8,7,6,5,5,4,4,3,3,3,2,2,2,2,1,1,1,1,1,1,9,8,7,7,6,5,5,4,4,3,3,3, %T A363249 2,2,2,2,1,1,1,1,1,1,9,8,7,7,6,5,5,4,4,3,3,3,2,2,2,1,1,1,1,1,1,1,9,8, %U A363249 7,6,6,5,5,4,4,3,3,2,2,2,2,1,1,1,1,1,1,1,9,8,7,6,6,5,4,4,4,3,3,2,2 %N A363249 Leading digit of 9^n. %D A363249 He, Xinwei; Hildebrand, A J; Li, Yuchen; Zhang, Yunyi, Complexity of Leading Digit Sequences, Discrete Mathematics and Theoretical Computer Science; 22 (2020), #14. %H A363249 Seiichi Manyama, <a href="/A363249/b363249.txt">Table of n, a(n) for n = 0..10000</a> %F A363249 a(n) = A000030(A001019(n)). %F A363249 a(n) = A060956(2*n). %t A363249 a[n_] := IntegerDigits[9^n][[1]]; Array[a, 100, 0] (* _Amiram Eldar_, Jul 15 2023 *) %o A363249 (PARI) a(n) = digits(9^n)[1]; %Y A363249 Cf. A008952, A060956, A111395, A362871, A363093, A364185. %Y A363249 Cf. A000030, A001019, A008570. %K A363249 nonn,base,easy %O A363249 0,2 %A A363249 _Seiichi Manyama_, Jul 15 2023