Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093233
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093233 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 33. +0
1
0, 99, 7924, 9966996, 777484447, 99996699996, 77777704444440777777, 999999669999996, 77777700044444400077777700, 9999999966999999996 (list; graph; listen)
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: A017762 A069363 A163051 this_sequence A046173 A098609 A132607

Adjacent sequences: A093230 A093231 A093232 this_sequence A093234 A093235 A093236

KEYWORD

base,nonn

AUTHOR

Hans Havermann (pxp(AT)rogers.com), Mar 28 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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research