Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092320
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092320 "Word-factorable" numbers, or numbers n that are divisible by the number of letters in the English word(s) for n. +0
1
4, 6, 12, 30, 33, 36, 40, 45, 50, 54, 60, 70, 81, 88, 90, 100, 112, 150, 162, 170, 200, 240, 252, 300, 304, 336, 340, 405, 406, 418, 456, 513, 525, 528, 551, 560, 567, 600, 660, 665, 666, 693, 704, 720, 748, 810, 828, 850, 858, 874, 882, 897, 910, 924, 960, 1005 (list; graph; listen)
OFFSET

0,1

COMMENT

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 (rayjchandler(AT)sbcglobal.net), Feb 16 2004

REFERENCES

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

EXAMPLE

"One hundred twelve" has 16 letters and 112=16*7.

CROSSREFS

Sequence in context: A090608 A115076 A126259 this_sequence A056495 A025018 A102043

Adjacent sequences: A092317 A092318 A092319 this_sequence A092321 A092322 A092323

KEYWORD

base,easy,nonn,word

AUTHOR

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

EXTENSIONS

More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Feb 16 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research