Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093297
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093297 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 97. +0
1
0, 97, 970, 116499, 99910, 999973, 9990903555050, 6660000611100001, 333030003555050005, 8880880008444044000422202200021110110001 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 116499 because its length-4 substrings (1164, 1649, 6499) are all distinct and divisible by 97, and there is no larger number with this property

CROSSREFS

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

Sequence in context: A113891 A090157 A070845 this_sequence A068852 A093944 A127748

Adjacent sequences: A093294 A093295 A093296 this_sequence A093298 A093299 A093300

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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research