Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093231
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093231 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 31. +0
1
0, 931, 1558992, 709920775022, 9994488877, 111011222022444044888088, 888088055505507770770, 777077005550550088808800, 888800008444400004222200002111100001, 88888888819999999995 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 1558992 because its length-3 substrings (155, 558, 589, 899, 992) are all distinct and divisible by 31, and there is no larger number with this property

CROSSREFS

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

Sequence in context: A068651 A115958 A035856 this_sequence A105213 A013545 A029570

Adjacent sequences: A093228 A093229 A093230 this_sequence A093232 A093233 A093234

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research