

A301408


Repeatedly map numbers to the number of letters in the English name (include spaces, but no hyphens and no "and"s); sequence gives smallest nonnegative integer that needs exactly n iterations to get to 4.


0




OFFSET

0,1


REFERENCES

M. Ecker, Number play, calculators, and card tricks: Mathemagical black holes, in E. Berlekamp and T. Rodgers, eds., The Mathemagician and Pied Puzzler: A Collection in Tribute to Martin Gardner, A. K. Peters, 1999, pp. 4152.


LINKS

Table of n, a(n) for n=0..7.


EXAMPLE

Since "twenty three" has 12 letters (including the space), "twelve" has 6 letters, "three" has 5 letters, "four" has four letters, and no other smaller nonnegative integer maps to 4 in exactly 5 iterations, then a(5) = 23.


CROSSREFS

Cf. A227290, A005589, A016037 (these do not count the spaces in the names of larger integers).
Sequence in context: A130801 A280579 A086165 * A227290 A096303 A262695
Adjacent sequences: A301405 A301406 A301407 * A301409 A301410 A301411


KEYWORD

nonn,word,less


AUTHOR

Matthew E. Coppenbarger, Mar 20 2018


STATUS

approved



