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.

A356738 Smallest positive integer whose American English name consists of n words.

Original entry on oeis.org

1, 21, 101, 121, 1101, 1121, 21121, 101121, 121121, 1101121, 1121121, 21121121, 101121121, 121121121, 1101121121, 1121121121, 21121121121, 121121121121, 1101121121121, 1121121121121, 21121121121121, 101121121121121, 121121121121121, 1101121121121121
Offset: 1

Views

Author

Ivan N. Ianakiev, Aug 25 2022

Keywords

Crossrefs

Cf. A080777.

Programs

  • Mathematica
    name[n_]:=StringReplace[IntegerName[n,"Words"],{"-"->" ",", "->" "}];
    nameLen[n_]:=WordCount[name[n]]; f[1]=1; f[n_]:=f[n]=Module[{k=f[n-1]},
    While[nameLen[k]
    				

Formula

a(n) == 1 (mod 20).