A164128 a(n) = smallest number m such that m divided by the number of letters in m (in Spanish) is n. If there is no such number then a(n) = 0.

5, 8, 12, 52, 40, 84, 154, 96, 0, 70, 110, 0, 286, 0, 210, 368, 0, 432, 418, 200, 0, 0, 460, 408, 100, 0, 648, 0, 0, 540, 682, 736, 0, 0, 630, 792, 0, 0, 819, 0, 0, 966, 602, 1144, 0, 1242, 0, 1152, 0, 500, 1173, 1196, 0, 810, 990, 1064, 0, 1566, 1593, 1140, 1769, 1736

Offset

1,1

References

Claudio Meller e-mail August 10, 2009, with program solution of this sequence.

Links

Table of n, a(n) for n=1..62.

Rodolfo Marcelo Kurchan, Numeros de Buen Nombre (in Spanish), Magazine El Acertijo Number 6, page 13.

Example

a(1) = 5 because CINCO has 5 letters and 5/5 = 1.
a(2) = 8 because OCHO has 4  letters and 8/4 = 2.
a(3) = 12 because DOCE has 4 letters and 12/4 = 3.

Crossrefs

Cf. A164127.

Sequence in context: A124434 A180930 A185729 * A259912 A078412 A144650

Adjacent sequences: A164125 A164126 A164127 * A164129 A164130 A164131

Keyword

nonn,word

Author

Rodolfo Kurchan, Aug 10 2009

Status

approved