Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093222
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A093222
%S A093222 0,88,990220,8866886,9999022220,88886688886,99999902222220,
%T A093222 888888668888886
%N A093222 a(n) is the largest number such that all of a(n)'s length-n substrings 
               are distinct and divisible by 22.
%H A093222 Hans Havermann, <a href="a093211.txt">Table of A093211-A093299</a>
%e A093222 a(3) is 990220 because its length-3 substrings (990, 902, 022, 220) are 
               all distinct and divisible by 22 and there is no larger number with 
               this property
%Y A093222 Cf. A093211, A093212, ..., A093299.
%Y A093222 Sequence in context: A093244 A079036 A159420 this_sequence A114922 A036951 
               A051328
%Y A093222 Adjacent sequences: A093219 A093220 A093221 this_sequence A093223 A093224 
               A093225
%K A093222 base,nonn
%O A093222 1,2
%A A093222 Hans Havermann (pxp(AT)rogers.com), Mar 28 2004

    
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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research