Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093254
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093254 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 54. +0
1
0, 54, 86486, 669666, 66690666, 88884088884, 666667866666, 66666672666666, 88888860088888860, 6666666660666666666 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 86486 because its length-3 substrings (864, 648, 486) are all distinct and divisible by 54 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A085482 A084226 A071800 this_sequence A151635 A159732 A012854

Adjacent sequences: A093251 A093252 A093253 this_sequence A093255 A093256 A093257

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research