login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059969 a(n) = n times the number of letters in n (in English). 0

%I #15 Oct 07 2018 03:22:46

%S 0,3,6,15,16,20,18,35,40,36,30,66,72,104,112,105,112,153,144,152,120,

%T 189,198,253,240,250,234,297,308,290,180,279,288,363,340,350,324,407,

%U 418,390,200,328,336,430,396,405,368,470,480,441,250,408,416,530,486

%N a(n) = n times the number of letters in n (in English).

%F a(n) = n*A005589(n). - _Arkadiusz Wesolowski_, Jun 01 2011

%e a(7)=35 because 7 * 5 (seven has 5 letters) = 35.

%Y Cf. A005589.

%K easy,nonn,word

%O 0,2

%A _Rodolfo Kurchan_, Mar 11 2001

%E a(0) prepended by _Arkadiusz Wesolowski_, Jun 01 2011

%E More terms from _Nathaniel Johnston_, Jun 02 2011

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 18:58 EDT 2024. Contains 371781 sequences. (Running on oeis4.)