Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093219
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093219 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 19. +0
1
0, 19576, 722855133, 77714446555, 1100133003990098800855005, 99960944490466640699960, 444440433333037777707, 6666606077777070555550509999909011111010, 999999982, 11111101019999990909555555050577777707076666660606 (list; graph; listen)
OFFSET

1,2

COMMENT

Based on an Erich Friedman observation of a(3).

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(2) is 19576 because its length-2 substrings (19, 95, 57, 76) are all distinct and divisible by 19 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A033869 A031801 A022213 this_sequence A069369 A115472 A022234

Adjacent sequences: A093216 A093217 A093218 this_sequence A093220 A093221 A093222

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research