cp's OEIS Frontend

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.

A362439 a(n) = (number of letters in n in French) + (number of letters in n in German).

Original entry on oeis.org

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, 23, 25, 23, 23, 13, 23, 24, 25, 26, 24, 24, 25, 24, 24, 15, 25, 26, 27, 28, 26, 26, 28, 26, 26, 16, 26, 27, 28, 29, 27, 27, 29, 27, 27, 15, 25, 26, 27, 28, 26, 26, 28, 26, 26, 18
Offset: 0

Views

Author

N. J. A. Sloane, Apr 21 2023

Keywords

Comments

More precisely, a(n) = A167507(n) + A007208(n).

References

  • GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See page 79.

Crossrefs