Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014563
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A014563
%S A014563 1,4,13,14,31,36,54,96,113,311,487,854,1036,1277,1646,3214,8351,10456,
%T A014563 11414,11536,11563,17606,17813,30287,36786,41544,54927,56547,56586,
%U A014563 57363,62469,62634,72813,72897,76944,78345,95061,97944,100963,101944
%N A014563 a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are 
               all (with multiplicity) contained in the digits of a(n+1)^2, with 
               a(0)=1.
%C A014563 Provably infinite. - David W. Wilson (davidwwilson(AT)comcast.net), Jan 
               29, 2002
%e A014563 13^2 = 169 and 14 is the next smallest number whose square (in this case 
               196) contains the digits 1,6,9.
%Y A014563 If "contained in" is replaced by "properly contained in" we get A065297.
%Y A014563 Cf. A066825, A067633, A067634, A067635, A065297.
%Y A014563 Sequence in context: A135783 A135406 A066825 this_sequence A066774 A075339 
               A089733
%Y A014563 Adjacent sequences: A014560 A014561 A014562 this_sequence A014564 A014565 
               A014566
%K A014563 base,nonn,nice
%O A014563 0,2
%A A014563 Marc Paulhus (paulhus(AT)wanadoo.nl), Jan 29, 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