This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A109336 "Que sera, sera" sequence: self-describing sequence where a(n) gives the number of n+1's which will be concatenated to form a(n+1); starting with a(1) = 1. 0
 1, 2, 33, 444444444444444444444444444444444 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(1) = 1. For n > 1, let k = floor(1+log_10(n)); then a(n) = n*(10^(k*a(n-1))-1)/(10^k-1). EXAMPLE a(1) says: there will be one 2 in a(2). a(2)=2 because a(1) said so; and a(2)=2 says: there will be two 3's in a(3). a(3)=33 because a(2) said so; and also a(3) says: there will be thirty three 4's in a(4). Therefore a(4)= 444444444444444444444444444444444 (33 times the digit 4). And a(5)= 555555555555555...555 (with 444444444444444444444444444444444 5's). CROSSREFS Cf. A001462, A001463, A103320, A102357, A076782. Sequence in context: A117969 A003820 A112980 * A180342 A098869 A131544 Adjacent sequences:  A109333 A109334 A109335 * A109337 A109338 A109339 KEYWORD base,nonn AUTHOR Alexandre Wajnberg, Aug 23 2005 EXTENSIONS Formula corrected to handle n>9 also by Rick L. Shepherd, Mar 22 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .