OFFSET

1,1

COMMENTS

Cal Q. Leytor (obviously an alias) asked for the lowest pair of consecutive word-factorable numbers.

Lowest pair of consecutive word-factorable numbers is 405-406; next is 665-666. - Ray Chandler, Feb 16 2004

Subsequence of A002808 (composite numbers). - Ivan N. Ianakiev, Mar 01 2020

REFERENCES

Cal Q. Leytor, The Word Factor, GAMES, October 1986, page 52.

LINKS

Michael S. Branicky, Table of n, a(n) for n = 1..10000

EXAMPLE

"One hundred twelve" has 16 letters and 112=16*7, so 112 is a term.

MATHEMATICA

Select[Range[1000], Divisible[#, StringLength[StringReplace[IntegerName[#],

{"\[Hyphen]" -> "", " " -> ""}]]] &] (* Ivan N. Ianakiev, Mar 01 2020 *)

PROG

(Python)

from num2words import num2words as n2w

def letters(n): return sum(c.isalpha() for c in n2w(n).replace(" and", ""))

def ok(n): return n%letters(n) == 0

print([k for k in range(1, 1000) if ok(k)]) # Michael S. Branicky, Jan 17 2022

CROSSREFS

KEYWORD

easy,nonn,word

AUTHOR

Bryce Herdt (mathidentity(AT)aol.com), Feb 15 2004

EXTENSIONS

More terms from Ray Chandler, Feb 16 2004

STATUS

approved