Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093299
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093299 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 99. +0
88
0, 99, 990, 9900990, 99990, 99990099990, 9999990, 999999009999990 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 9900990 because its length-4 substrings 9900, 9009, 0099, 0990) are all distinct and divisible by 99, and there is no larger number with this property

CROSSREFS

Cf. A093211, A093212, ..., A093298.

Adjacent sequences: A093296 A093297 A093298 this_sequence A093300 A093301 A093302

Sequence in context: A027579 A061366 A135219 this_sequence A074786 A133319 A017815

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research