Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067473
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A067473
%S A067473 36,324,3025,30276,300304,3003289,30008484,300017041,3000081529,
%T A067473 30000318436,300000484729,3000000666601,30000004655076,300000032019081,
%U A067473 3000000027329536,30000000084216561,300000000542063364
%N A067473 Smallest n-digit square starting with 3.
%F A067473 a(n) = ceiling(sqrt(3*10^(n-1)))^2, n>1. - Rick L. Shepherd (rshepherd2(AT)hotmail.com), 
               Feb 14 2002
%o A067473 (PARI) for(n=2,25,a=ceil(sqrt(3*10^(n-1)))^2; print(a))
%Y A067473 Cf. A035070 (roots), A045786, A067479 (2..9).
%Y A067473 Sequence in context: A045786 A017594 A014800 this_sequence A068075 A053136 
               A000821
%Y A067473 Adjacent sequences: A067470 A067471 A067472 this_sequence A067474 A067475 
               A067476
%K A067473 base,easy,nonn
%O A067473 2,1
%A A067473 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 09 2002
%E A067473 More terms from Rick L. Shepherd (rshepherd2(AT)hotmail.com), Feb 14 
               2002

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research