Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093262
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093262 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 62. +0
1
0, 62, 80620, 7006200, 99944888, 11011222022444044888088, 9999980, 9999050022220800, 888800008444400004222200002, 77770000704444000040 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 80620 because its length-3 substrings (806, 062, 620) are all distinct and divisible by 62 and there is no larger number with this property

CROSSREFS

Cf. A093211, A093212, ..., A093299.

Sequence in context: A042861 A056639 A123806 this_sequence A159374 A115460 A116270

Adjacent sequences: A093259 A093260 A093261 this_sequence A093263 A093264 A093265

KEYWORD

base,nonn

AUTHOR

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 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research