This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059969 a(n) = n times the number of letters in n (in English). 0
 0, 3, 6, 15, 16, 20, 18, 35, 40, 36, 30, 66, 72, 104, 112, 105, 112, 153, 144, 152, 120, 189, 198, 253, 240, 250, 234, 297, 308, 290, 180, 279, 288, 363, 340, 350, 324, 407, 418, 390, 200, 328, 336, 430, 396, 405, 368, 470, 480, 441, 250, 408, 416, 530, 486 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS FORMULA a(n) = n*A005589(n). - Arkadiusz Wesolowski, Jun 01 2011 EXAMPLE a(7)=35 because 7 * 5 (seven has 5 letters) = 35. CROSSREFS Cf. A005589. Sequence in context: A285823 A066904 A310124 * A224864 A176547 A310125 Adjacent sequences:  A059966 A059967 A059968 * A059970 A059971 A059972 KEYWORD easy,nonn,word AUTHOR Rodolfo Kurchan, Mar 11 2001 EXTENSIONS a(0) prepended by Arkadiusz Wesolowski, Jun 01 2011 More terms from Nathaniel Johnston, Jun 02 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 22 04:32 EDT 2019. Contains 321406 sequences. (Running on oeis4.)