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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A173906 Total number of digits of the squares of all n-digit numbers. 0
 16, 338, 5183, 69837, 878377, 10583772, 123837722, 1418377223, 15983772233, 177837722339, 1958377223398, 21383772233983, 231837722339831, 2498377223398316, 26783772233983162, 285837722339831620, 3038377223398316206, 32183772233983162066, 339837722339831620668, 3578377223398316206680 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Sequence inspired by Claudio Meller's email to [seqfan] 07:01 a.m., Nov 26 2010, subject: About a problem of Bernardo Recamán Santos found in http://www.mathpuzzle.com/ LINKS FORMULA As n -> infinity, a(n)/(n*10^(n+floor(log(log(n))+1)) -> 9/50. MATHEMATICA f[n_] := Block[{br = 1+ Floor[10^(n-1)*Sqrt@10]}, (2n-1)(br-10^(n-1)) + 2n(10^n-br)]; Array[f, 20] CROSSREFS Cf. A000290. Sequence in context: A058722 A318013 A320399 * A227102 A221577 A136269 Adjacent sequences: A173903 A173904 A173905 * A173907 A173908 A173909 KEYWORD nonn,base AUTHOR Robert G. Wilson v, Nov 26 2010 STATUS approved

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.

Last modified December 7 10:26 EST 2022. Contains 358656 sequences. (Running on oeis4.)