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 A362439 #3 Apr 21 2023 23:58:25 %S A362439 8,6,8,9,10,8,8,10,8,8,7,7,10,14,16,14,13,15,15,15,12,22,23,24,25,23, %T A362439 23,25,23,23,13,23,24,25,26,24,24,25,24,24,15,25,26,27,28,26,26,28,26, %U A362439 26,16,26,27,28,29,27,27,29,27,27,15,25,26,27,28,26,26,28,26,26,18 %N A362439 a(n) = (number of letters in n in French) + (number of letters in n in German). %C A362439 More precisely, a(n) = A167507(n) + A007208(n). %D A362439 GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See page 79. %Y A362439 Cf. A007208, A167507. %K A362439 nonn,word %O A362439 0,1 %A A362439 _N. J. A. Sloane_, Apr 21 2023