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 A102082 #13 Jul 16 2022 01:23:49
%S A102082 0,0,0,0,0,1,0,0,1,1,0,0,1,0,1,0,0,0,0,0,2,0,0,1,0,1,0,0,0,0,0,1,0,0,
%T A102082 1,2,0,0,0,0,0,2,0,0,2,0,1,0,0,0,0,1,0,0,0,0,0,2,2,0,0,1,0,0,0,0,0,0,
%U A102082 0,0,0,1,2,0,1,0,1,1,0,0,0,0,0,3,1,1,1
%N A102082 Number of times the n-th letter in an infinitely repeating English alphabet appears in the US English name for the number n.
%H A102082 Michael S. Branicky, <a href="/A102082/b102082.txt">Table of n, a(n) for n = 0..10000</a>
%e A102082 a(5) = 1 since letter 5 = e appears once in "five".
%e A102082 a(20) = 2 since letter 20 = t appears twice in "twenty".
%e A102082 a(34) = 1 since letter 34 = h appears once in "thirty four".
%e A102082 a(105) = 0 since letter 105 = a does not appear in "one hundred five".
%e A102082 a,b,c,... z, a, b, ... .
%e A102082 1,2,3,...26,27,28, ... .
%o A102082 (Python)
%o A102082 from num2words import num2words
%o A102082 def a(n): return num2words(n).replace(" and", "").count(chr(96+n%26))
%o A102082 print([a(n) for n in range(87)]) # _Michael S. Branicky_, Jul 15 2022
%Y A102082 Cf. A005589, A072959.
%K A102082 nonn,word
%O A102082 0,21
%A A102082 Jeremy Ballard (gtg056b(AT)prism.gatech.edu), Feb 13 2005
%E A102082 Name clarified, a(0) inserted, and a(34) and beyond from _Michael S. Branicky_, Jul 15 2022