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 A026858 #20 Apr 29 2024 09:29:13
%S A026858 4,3,3,3,7,6,3,5,4,4,5,6,6,7,11,8,6,11,8,10,5,7,8,8,12,11,8,10,8,9,6,
%T A026858 8,9,9,13,12,9,11,9,10,8,10,11,11,15,14,11,13,11,12,9,11,12,12,16,15,
%U A026858 12,14,12,13,8,10,11,11,15,14,11,13,11,12,8,10,11,11,15,14,11,13,11,12,7,9
%N A026858 Number of letters in n (in Italian).
%H A026858 Carmine Suriano, <a href="/A026858/b026858.txt">Table of n, a(n) for n = 0..10000</a>
%H A026858 <a href="/index/Lc#letters">Index entries for sequences related to number of letters in n</a>
%e A026858 Zero, uno, due, tre, quattro, cinque, sei, ...
%o A026858 (Python)
%o A026858 from num2words import num2words
%o A026858 def A026858(n): return len(num2words(n,lang='it')) # _Chai Wah Wu_, Apr 28 2024
%Y A026858 Cf. A005589.
%K A026858 nonn,word,easy
%O A026858 0,1
%A A026858 Alberto Maretti (alberto(AT)dis.uniroma1.it), Aug 03 2000
%E A026858 Corrected and extended by _Marco Broglia_, Oct 01 2008
%E A026858 Offset corrected to 0 ("zero") by _Carmine Suriano_, Jun 03 2011