|
| |
|
|
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
|
|
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
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Example a(1) = CINCO because 5 has 5 letters and 5 divided 5 = 1, a(2) = OCHO because 8 / 4 = 2, a(3) DOCE because 12 / 4 = 3.
|
|
|
REFERENCES
| Magazine El Acertijo Number 6, page 13 http://4.bp.blogspot.com/_g6-YNA7BClQ/SHa-j5jA6uI/AAAAAAAAAdE/KB6rE2sQOVU/s1600-h/el_a_06_p013.jpg
Claudio Meller e-mail August 10, 2009, with program solution of this sequence
|
|
|
CROSSREFS
| Cf. A164127.
Sequence in context: A124434 A180930 A185729 * A078412 A144650 A046038
Adjacent sequences: A164125 A164126 A164127 * A164129 A164130 A164131
|
|
|
KEYWORD
| nonn,word
|
|
|
AUTHOR
| Rodolfo Kurchan (rodolfokurchan(AT)yahoo.com.ar), Aug 10 2009
|
| |
|
|
