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 A344013 #40 Apr 16 2022 04:28:39
%S A344013 1,35,125,157,206,148,197,293,333,286,302,177,246,245,236,230,178,244,
%T A344013 275,295,342,274,326,247,253,281,285,293,333,286,302,177,246,245,236,
%U A344013 230,178,244,275,295,342,274,326,247,253,281,285,293,333,286,302,177,246,245,236,230,178,244,275
%N A344013 a(1)=1; thereafter a(n) = A169639(a(n-1)).
%C A344013 A French analog of A345126 (British English) and A345157 (US English).
%C A344013 Enters a cycle of length 20 starting from a(8). - _Chai Wah Wu_, Jun 12 2021
%e A344013 1 = un -> 35 = trente-cinq -> 125 -> cent vingt cinq = 157.
%t A344013 a[1]=1;a[n_]:=a[n]=Total@LetterNumber@StringDelete[IntegerName[a[n-1],"French"],{" ","-"}];Array[a,100] (* _Giorgos Kalogeropoulos_, Jun 11 2021 *)
%o A344013 (Python)
%o A344013 from num2words import num2words
%o A344013 from unidecode import unidecode
%o A344013 A344013_list = [1]
%o A344013 for _ in range(10):
%o A344013 A344013_list.append(sum(ord(s)-96 for s in unidecode(num2words(A344013_list[-1],lang='fr')) if s.isalpha())) # _Chai Wah Wu_, Jun 11 2021
%Y A344013 Cf. A073327, A169639, A345240, A345126, A345157.
%K A344013 nonn,word
%O A344013 1,2
%A A344013 _Simon Plouffe_ and _N. J. A. Sloane_, Jun 10 2021
%E A344013 More terms from _Chai Wah Wu_, Jun 11 2021