Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093260
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093260 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 60. +0
1
0, 600, 96000, 9960000, 999600000, 99996000000, 9999960000000, 999999600000000 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 96000 because its length-3 substrings (960, 600, 000) are all distinct and divisible by 60 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A048530 A023915 A035850 this_sequence A008689 A126835 A020370

Adjacent sequences: A093257 A093258 A093259 this_sequence A093261 A093262 A093263

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 December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research