login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067473 Smallest n-digit square starting with 3. 2
36, 324, 3025, 30276, 300304, 3003289, 30008484, 300017041, 3000081529, 30000318436, 300000484729, 3000000666601, 30000004655076, 300000032019081, 3000000027329536, 30000000084216561, 300000000542063364 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

LINKS

Table of n, a(n) for n=2..18.

FORMULA

a(n) = ceiling(sqrt(3*10^(n-1)))^2, n>1. - Rick L. Shepherd, Feb 14 2002

PROG

(PARI) for(n=2, 25, a=ceil(sqrt(3*10^(n-1)))^2; print(a))

CROSSREFS

Cf. A035070 (roots), A045786, A067479 (2..9).

Sequence in context: A017594 A014800 A213124 * A223299 A068075 A219004

Adjacent sequences:  A067470 A067471 A067472 * A067474 A067475 A067476

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy, Feb 09 2002

EXTENSIONS

More terms from Rick L. Shepherd, Feb 14 2002

STATUS

approved

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

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

Last modified August 1 07:40 EDT 2014. Contains 245112 sequences.