Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093281
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093281 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 81. +0
1
0, 81, 9729, 996399, 99954999, 99630099630, 999993699999, 99999927999999, 99999991899999991, 9999999990999999999 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 996399 because its length-4 substrings (9963, 9639, 6399) are all distinct and divisible by 81, and there is no larger number with this property

CROSSREFS

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

Sequence in context: A123847 A115443 A034993 this_sequence A059988 A017020 A058422

Adjacent sequences: A093278 A093279 A093280 this_sequence A093282 A093283 A093284

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research