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 A305100 #29 Sep 01 2025 11:12:55 %S A305100 3,1,4,0,14,18,21,24,28,68,124,128,168,224,228,268,468,868,1268,1468, %T A305100 1868,2268,2468,2868,4868,8868,14868,18868,21868,24868,28868,68868, %U A305100 124868,128868,168868,224868,228868,268868,468868,868868,1068868,1124868,1128868,1168868 %N A305100 Least nonnegative integer which requires n letters to spell in Turkish excluding spaces and hyphens. %H A305100 Sezai Ata, <a href="https://doi.org/10.13140/RG.2.2.19342.87363">MATLAB program</a>, 2018. %H A305100 Wikibooks, <a href="https://en.wikibooks.org/wiki/Turkish/Numbers">Turkish numbers</a> %H A305100 <a href="/index/Lc#letters">Index entries for sequences related to number of letters in n</a> %e A305100 a(2) = 3: "üç", a(3) = 1: "bir", a(5) = 0: "sıfır" %o A305100 (Python) %o A305100 from num2words import num2words %o A305100 from itertools import count, islice %o A305100 def f(n): return sum(1 for c in num2words(n, lang='tr') if c.isalpha()) %o A305100 def agen(): # generator of terms %o A305100 n, adict = 2, dict() %o A305100 for k in count(0): %o A305100 v = f(k) %o A305100 if v not in adict: %o A305100 adict[v] = k %o A305100 while n in adict: %o A305100 yield adict[n] %o A305100 n += 1 %o A305100 print(list(islice(agen(), 44))) # _Michael S. Branicky_, Sep 01 2025 %Y A305100 Turkish version of A134629. %Y A305100 Cf. A057435. %K A305100 nonn,word,changed %O A305100 2,1 %A A305100 _Sezai Ata_, May 25 2018 %E A305100 a(16)-a(41) from _Daniel Suteu_, May 26 2018 %E A305100 a(42)-a(45) from _Michael S. Branicky_, Sep 01 2025