Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093295
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093295 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 95. +0
1
0, 95, 2855, 446555, 800855005, 999970, 9999985, 7777707055555050, 999999925, 99999090005555505000 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 446555 because its length-4 substrings (4465, 4655, 6555) are all distinct and divisible by 95, and there is no larger number with this property

CROSSREFS

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

Sequence in context: A116250 A020322 A055829 this_sequence A060484 A017811 A017758

Adjacent sequences: A093292 A093293 A093294 this_sequence A093296 A093297 A093298

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