Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067479
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A067479
%S A067479 9,0,900,9025,90000,900601,9000000,90003169,900000000,9000127161,
%T A067479 90000000000,900001331856,9000000000000,90000000369889,900000000000000,
%U A067479 9000000036988900,90000000000000000,900000001801523401
%N A067479 Smallest n-digit square starting with 9, or 0 if no such number exists.
%F A067479 a[n+1]=floor(sqrt(9*10^n))+(n mod 2))^2, a[2]=0 - Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), 
               Mar 18 2002
%Y A067479 Cf. A035076 (roots), A045792.
%Y A067479 Cf. 2: A067472, 3: A067473, 4: A067474, 5: A067475, 6: A067476, 7: A067477, 
               8: A067478.
%Y A067479 Sequence in context: A167319 A057403 A157309 this_sequence A166734 A155783 
               A121935
%Y A067479 Adjacent sequences: A067476 A067477 A067478 this_sequence A067480 A067481 
               A067482
%K A067479 base,easy,nonn
%O A067479 1,1
%A A067479 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 09 2002
%E A067479 More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Mar 18 
               2002

    
page 1

Search completed in 0.002 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 November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research