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!)
A049415 Number of squares (of positive integers) with n digits. 9
3, 6, 22, 68, 217, 683, 2163, 6837, 21623, 68377, 216228, 683772, 2162278, 6837722, 21622777, 68377223, 216227767, 683772233, 2162277661, 6837722339, 21622776602, 68377223398, 216227766017, 683772233983, 2162277660169 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) + A180426(n) + A180429(n) + A180347(n) = A052268(n).
Lim_{n->infinity} a(2n)/10^n = 1 - 1/sqrt(10);
lim_{n->infinity} a(2n-1)/10^n = 1/sqrt(10) - 1/10. - Robert G. Wilson v, Aug 29 2012
LINKS
FORMULA
a(n) = ceiling(sqrt(10^n)) - ceiling(sqrt(10^(n-1))).
From Jon E. Schoenfield, Nov 30 2019: (Start)
a(2n) = floor(10^n * (1 - 1/sqrt(10))), so each even-indexed term a(2n) is given by the first n digits (after the decimal point) of 1 - 1/sqrt(10) = 0.68377223398316...;
a(2n-1) = ceiling(10^n * (1/sqrt(10) - 1/10)), so each odd-indexed term a(2n-1) is given by the first n digits (after the decimal point) of 1/sqrt(10) - 1/10 = 0.21622776601683..., plus 1. (End)
EXAMPLE
22 squares (100=10^2, 121=11^2, ...., 961=31^2) have 3 digits, hence a(3)=22.
MATHEMATICA
f[n_] := Ceiling[Sqrt[10^n - 1]] - Ceiling[Sqrt[10^(n - 1)]]; f[1] = 3; Array[f, 24] (* Robert G. Wilson v, Aug 29 2012 *)
PROG
(Magma) [Ceiling(Sqrt(10^n))-Ceiling(Sqrt(10^(n-1))) : n in [1..30]]; // Vincenzo Librandi, Oct 01 2011
CROSSREFS
A049415(n) = A017936(n+1) - A017936(n) = A049416(n+1) - A049416(n).
Cf. A062940.
Sequence in context: A148640 A148641 A148642 * A208939 A209067 A220166
KEYWORD
nonn,easy,base
AUTHOR
Ulrich Schimke (ulrschimke(AT)aol.com)
EXTENSIONS
More terms from Dean Hickerson, Jul 10 2001
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)