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 A341737 #40 Jun 30 2021 19:56:06
%S A341737 1,2,2,2,2,3,2,3,3,4,2,2,3,3,3,3,3,3,4,4,2,3,2,3,3,4,3,4,3,4,2,3,3,3,
%T A341737 3,4,3,4,4,5,2,3,3,3,3,4,3,4,4,5,3,3,4,4,4,4,4,4,5,5,2,3,3,3,3,4,3,4,
%U A341737 4,5,3,3,4,4,4,4,4,4,5,5,3,4,3,4,4,5,4
%N A341737 a(n) is the number of segments necessary to represent n in the Cistercian numeral system.
%C A341737 The sequence is finite because the numeral system of Cistercian monks allows us to represent the numbers from 0 to 9999.
%H A341737 Stefano Spezia, <a href="/A341737/b341737.txt">Table of n, a(n) for n = 0..9999</a>
%H A341737 Daniel Carter Beard, <a href="https://archive.org/details/americanboysbook00bear5/page/92/mode/2up">The American boys' book of signs, signals and symbols</a>. New York Public Library. Philadelphia: Lippincott. p. 92, 1918.
%H A341737 dCode, <a href="https://www.dcode.fr/cistercian-numbers">Cistercian Monk Numerals</a>
%H A341737 Lauron William De Laurence, <a href="https://archive.org/details/greatbookmagica00laurgoog/page/n190/mode/2up">The Great Book of Magical Art, Hindu Magic and East Indian Occultism</a>. Chicago: De Laurence Co. p. 174, 1915.
%H A341737 Agrippa von Nettesheim and Heinrich Cornelius, <a href="https://archive.org/details/DeOccultaPhilosophiaJungCollection1533/page/n160/mode/1up">De Occulta Philosophia</a>, pp. CXLII - CXLIII, 1533 (in Latin).
%H A341737 Wikipedia, <a href="https://en.wikipedia.org/wiki/Cistercian_numerals">Cistercian numerals</a>
%F A341737 a(n) <= 9.
%t A341737 SN:={"0"->1,"1"->2,"2"->2,"3"->2,"4"->2,"5"->3,"6"->2,"7"->3,"8"->3,"9"->4}; OI:={11,15,17,19,22,28,29,51,55,57,59,71,75,77,79,82,88,89,91,92,95,97,98,99}; Table[(Characters[IntegerString[Floor[n/100]]]/. SN//Total)-Length[Characters[IntegerString[Floor[n/100]]]]+1-If[MemberQ[OI,Floor[n/100]],1,0]-Boole[Floor[n/100]==99]+(Characters[IntegerString[Mod[n,100]]]/. SN//Total)-Length[Characters[IntegerString[Mod[n,100]]]]+1-If[MemberQ[OI,Mod[n,100]],1,0]-Boole[Mod[n,100]==99]-1,{n,0,9999}]
%t A341737 (* Function for visualizing a Cistercian numeral *)
%t A341737 CistercianNumeral[n_]:=ResourceFunction["CistercianNumberEncode"][n];
%Y A341737 Cf. A002963, A092196, A119281.
%K A341737 nonn,base,fini,full
%O A341737 0,2
%A A341737 _Stefano Spezia_, Feb 18 2021