Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093255
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A093255
%S A093255 0,55,660550,5500550,6666055550,55550055550,66666605555550,
%T A093255 555555005555550
%N A093255 a(n) is the largest number such that all of a(n)'s length-n substrings 
               are distinct and divisible by 55.
%H A093255 Hans Havermann, <a href="a093211.txt">Table of A093211-A093299</a>
%e A093255 a(3) is 660550 because its length-3 substrings (660, 605, 055, 550) are 
               all distinct and divisible by 55 and there is no larger number with 
               this property
%Y A093255 Cf. A093211, A093212, ..., A093299.
%Y A093255 Sequence in context: A033512 A027580 A046194 this_sequence A115410 A036197 
               A107676
%Y A093255 Adjacent sequences: A093252 A093253 A093254 this_sequence A093256 A093257 
               A093258
%K A093255 base,nonn
%O A093255 1,2
%A A093255 Hans Havermann (pxp(AT)rogers.com), Mar 29 2004

    
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 December 9 18:50 EST 2009. Contains 170568 sequences.


AT&T Labs Research