login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093233 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 33. 0
0, 99, 7924, 9966996, 777484447, 99996699996, 77777704444440777777, 999999669999996, 77777700044444400077777700, 9999999966999999996 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 9966996 because its length-4 substrings (9966, 9669, 6699, 6996) are all distinct and divisible by 33 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A196221 A069363 A163051 * A046173 A171415 A098609

Adjacent sequences:  A093230 A093231 A093232 * A093234 A093235 A093236

KEYWORD

base,nonn

AUTHOR

Hans Havermann (gladhobo(AT)teksavvy.com), Mar 28 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 09:30 EST 2012. Contains 206009 sequences.