Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093223
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093223 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 23. +0
1
0, 46923, 5759897, 340483036808, 5554533373, 999994888881222226, 220202055050501101010, 11111001222220024444400488888008, 666660060555550050888880080 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(2) is 46923 because its length-2 substrings (46, 69, 92, 23) are all distinct and divisible by 23 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A052359 A066359 A109030 this_sequence A069370 A166003 A043615

Adjacent sequences: A093220 A093221 A093222 this_sequence A093224 A093225 A093226

KEYWORD

base,nonn

AUTHOR

Hans Havermann (pxp(AT)rogers.com), Mar 27 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 24 19:42 EST 2009. Contains 167435 sequences.


AT&T Labs Research