|
Search: id:A164127
|
|
|
| A164127 |
|
a(n) = smallest number m such that m divided by the number of letters in m (in English) is n. If there is no such number then a(n) = 0 |
|
+0
2
|
|
| 4, 6, 33, 36, 30, 54, 56, 40, 81, 50, 0, 60, 0, 252, 90, 240, 0, 0, 304, 200, 0, 0, 0, 456, 300, 0, 405, 0, 406, 0, 0, 0, 693, 748, 560, 828, 666, 874, 858, 720, 1107, 882, 0, 660, 1485, 1380, 1034, 1536, 1470, 850, 1683, 1092, 1749, 810, 1540, 0, 1881, 1856, 1003
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Example a(1) = four because 4 has 4 letters and 4 divided 4 = 1, a(2) = six because 6 / 3 = 2, a(3) thirty three becuase 33 / 11 = 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
|
Sequence in context: A068402 A078250 A087299 this_sequence A071394 A137021 A092187
Adjacent sequences: A164124 A164125 A164126 this_sequence A164128 A164129 A164130
|
|
KEYWORD
|
nonn,word
|
|
AUTHOR
|
Rodolfo Kurchan (rodolfokurchan(AT)yahoo.com.ar), Aug 10 2009
|
|
|
Search completed in 0.002 seconds
|
