Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093251
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093251 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 51. +0
1
0, 51, 5612, 11224488, 9990933303, 666060333030, 77777551111188, 99999984, 888888180555555750, 33333030336666606066 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 11224488 because its length-4 substrings (1122, 1224, 2244, 2448, 4488) are all distinct and divisible by 51, and there is no larger number with this property

CROSSREFS

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

Sequence in context: A128917 A015271 A099397 this_sequence A135531 A038777 A022079

Adjacent sequences: A093248 A093249 A093250 this_sequence A093252 A093253 A093254

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research