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 A319358 #39 Mar 30 2025 23:50:08 %S A319358 0,387420489,913517247483640899,991035916125874083964008999, %T A319358 999100359916012598740083996400089999, %U A319358 999910003599916001259987400083999640000899999,999991000035999916000125999874000083999964000008999999 %N A319358 a(n) = (10^n - 1)^9. %C A319358 Number of 9 in a(n) is 5*n-8 for n > 2. %H A319358 Seiichi Manyama, <a href="/A319358/b319358.txt">Table of n, a(n) for n = 0..100</a> %H A319358 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (1111111111, -112233445443322110, 1123457901110987543211000, -1123570145779775409653211000000, 112358025801220975197532110000000000, -1123570145779775409653211000000000000000, 1123457901110987543211000000000000000000000, -112233445443322110000000000000000000000000000, 1111111111000000000000000000000000000000000000, -1000000000000000000000000000000000000000000000). %F A319358 a(n) = A002283(n)^9. %e A319358 n| a(n) can be divided into 9 parts for n > 3. %e A319358 -+------------------------------------------------------ %e A319358 3| 99 1035 9 16125 874083 9 64008 999 %e A319358 4| 999 10035 99 160125 9 8740083 99 640008 9999 %e A319358 5| 9999 100035 999 1600125 99 87400083 999 6400008 99999 %t A319358 a[n_]:=(10^n - 1)^9 ; Array[a, 50, 0] (* _Stefano Spezia_, Sep 17 2018 *) %o A319358 (PARI) a(n) = (10^n-1)^9; %Y A319358 Cf. A001017, A002283, A059988, A272067, A272068. %K A319358 nonn %O A319358 0,2 %A A319358 _Seiichi Manyama_, Sep 17 2018