Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093214
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093214 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 14. +0
1
0, 98428, 7560280, 991288484424228288, 57750400406006020020, 9999782222082222, 773773000200200060060004004000, 99999998444444428888888422222228444444 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(2) is 98428 because its length-2 substrings (98, 84, 42, 28) are all distinct and divisible by 14, and there is no larger number with this property

CROSSREFS

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

Adjacent sequences: A093211 A093212 A093213 this_sequence A093215 A093216 A093217

Sequence in context: A022214 A109185 A002273 this_sequence A052090 A106776 A093778

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research