Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093239
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093239 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 39. +0
1
0, 78, 50780, 30039009, 2102184084, 99996099996, 88888802222220, 9999990033333300, 88888885855555558588888885, 55555530032222229009 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 50780 because its length-3 substrings (507, 078, 780) are all distinct and divisible by 39, and there is no larger number with this property

CROSSREFS

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

Sequence in context: A119216 A119236 A126998 this_sequence A064991 A051326 A033399

Adjacent sequences: A093236 A093237 A093238 this_sequence A093240 A093241 A093242

KEYWORD

base,nonn

AUTHOR

Hans Havermann (pxp(AT)rogers.com), Mar 28 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 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research