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 A343609 #32 Mar 01 2025 16:08:45
%S A343609 0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,
%T A343609 3,3,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,7,7,7,7,7,
%U A343609 7,7,7,7,8,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,10,10,10,10,10
%N A343609 a(n) = floor(n/9).
%C A343609 Also: Nonnegative integers repeated 9 times (with natural offset 0).
%H A343609 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,1,-1).
%F A343609 a(n) = A002264(A002264(n)).
%F A343609 a(n) = a(n-1) + a(n-9) - a(n-10), n > 9;
%F A343609 G.f.: x^9/(1 - x - x^9 + x^10).
%p A343609 A343609 := n -> iquo(n,9); # illustration: map( A343609, [$0..99] );
%t A343609 A343609[n_] := Floor[n/9]
%t A343609 a[n_] := Quotient[n, 9]; Array[a, 100, 0] (* _Amiram Eldar_, May 19 2021 *)
%t A343609 LinearRecurrence[{1,0,0,0,0,0,0,0,1,-1},{0,0,0,0,0,0,0,0,0,1},100] (* _Harvey P. Dale_, Mar 01 2025 *)
%o A343609 (PARI) apply( A343609(n)=n\9, [0..99])
%Y A343609 Cf. A004526 ([n/2]), A002264 ([n/3]), A002265 ([n/4]), A002266 ([n/5]), A152467 ([n/6]), A132270 ([(n-1)/7]), A132292 ([(n-1)/8]), A059995 ([n/10]), A344420 ([n/11]), A342696 ([n/12]).
%Y A343609 Repunits A002275 = A343609 o A011557.
%K A343609 nonn,easy
%O A343609 0,19
%A A343609 _M. F. Hasler_, May 19 2021