Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093217
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093217 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 17. +0
1
0, 68517, 4935782, 99962227888, 9990933303111016660622202, 888080444040222020111010999090, 77770071111001555500588880086666006, 99999899888889889999989, 666660066888880088555550055111110011777770077 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(2) is 68517 because its length-2 substrings (68, 85, 51, 17) are all distinct and divisible by 17, and there is no larger number with this property

CROSSREFS

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

Sequence in context: A022256 A101697 A104948 this_sequence A031845 A031863 A121107

Adjacent sequences: A093214 A093215 A093216 this_sequence A093218 A093219 A093220

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


AT&T Labs Research