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 A110592 #23 Dec 13 2019 05:35:02
%S A110592 1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,
%T A110592 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%U A110592 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3
%N A110592 Number of digits in base-5 representation of n. String length of A007091.
%C A110592 In terms of the repetition convolution operator #, where (sequence A) # (sequence B) = the sequence consisting of A(n) copies of B(n), then this sequence is the repetition convolution A110595 # n. Over the set of positive infinite integer sequences, # gives a nonassociative noncommutative groupoid (magma) with a left identity (A000012) but no right identity, where the left identity is also a right nullifier and idempotent. For any positive integer constant c, the sequence c*A000012 = (c,c,c,c,...) is also a right nullifier; for c = 1, this is A000012; for c = 3 this is A010701.
%H A110592 G. C. Greubel, <a href="/A110592/b110592.txt">Table of n, a(n) for n = 0..5000</a>
%F A110592 G.f.: 1 + (1/(1 - x))*Sum_{k>=0} x^(5^k). - _Ilya Gutkovskiy_, Jan 08 2017
%F A110592 a(n) = floor(log_5(n)) + 1 for n >= 1. - _Petros Hadjicostas_, Dec 12 2019
%t A110592 Join[{1},IntegerLength[Range[110],5]] (* _Harvey P. Dale_, Aug 03 2016 *)
%Y A110592 Cf. A007091, A081604, A110590, A110595, A330358.
%K A110592 nonn,base,easy
%O A110592 0,6
%A A110592 _Jonathan Vos Post_, Jul 29 2005