Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093253
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093253 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 53. +0
1
0, 53, 7954, 9063604240, 449449979977, 999951, 9999987, 707077779090999940404444, 444440404666660606999990909, 44444040407777707070 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 9063604240 because its length-4 substrings (9063, 0636, 6360, 3604, 6042, 0424, 4240) are all distinct and divisible by 53 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A059694 A088784 A104820 this_sequence A145332 A087530 A125037

Adjacent sequences: A093250 A093251 A093252 this_sequence A093254 A093255 A093256

KEYWORD

base,nonn

AUTHOR

Hans Havermann (pxp(AT)rogers.com), Mar 29 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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research