Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Jan 17 2022 03:52:00
%S 4,6,12,30,33,36,40,45,50,54,56,60,70,81,88,90,100,112,150,162,170,
%T 200,240,252,300,304,336,340,405,406,418,456,513,525,528,551,560,567,
%U 600,660,665,666,693,704,720,748,810,828,850,858,874,882,897,910,924,960,1005
%N "Word-factorable" numbers, or numbers k that are divisible by the number of letters in the American English word(s) for k.
%C Cal Q. Leytor (obviously an alias) asked for the lowest pair of consecutive word-factorable numbers.
%C Lowest pair of consecutive word-factorable numbers is 405-406; next is 665-666. - _Ray Chandler_, Feb 16 2004
%C Subsequence of A002808 (composite numbers). - _Ivan N. Ianakiev_, Mar 01 2020
%D Cal Q. Leytor, The Word Factor, GAMES, October 1986, page 52.
%H Michael S. Branicky, <a href="/A092320/b092320.txt">Table of n, a(n) for n = 1..10000</a>
%e "One hundred twelve" has 16 letters and 112=16*7, so 112 is a term.
%t Select[Range[1000],Divisible[#,StringLength[StringReplace[IntegerName[#],
%t {"\[Hyphen]" -> "", " " -> ""}]]] &] (* _Ivan N. Ianakiev_, Mar 01 2020 *)
%o (Python)
%o from num2words import num2words as n2w
%o def letters(n): return sum(c.isalpha() for c in n2w(n).replace(" and", ""))
%o def ok(n): return n%letters(n) == 0
%o print([k for k in range(1, 1000) if ok(k)]) # _Michael S. Branicky_, Jan 17 2022
%K easy,nonn,word
%O 1,1
%A Bryce Herdt (mathidentity(AT)aol.com), Feb 15 2004
%E More terms from _Ray Chandler_, Feb 16 2004