Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088885
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088885 Minimum number of consecutive previous nonnegative integers to n that must be concatenated together in descending order such that n divides the concatenated term, or zero if n divides no such concatenation. +0
3
1, 2, 2, 2, 5, 2, 0, 6, 8, 10, 0, 6, 0, 8, 5, 4, 2, 8, 3, 0, 0, 10, 0, 12, 0, 0, 26, 16, 0, 20, 0, 20, 11, 2, 20, 8, 0, 0, 0, 20, 40, 20, 4, 32, 35, 46, 38, 20, 40, 0, 2, 0, 0, 26, 10, 20, 3, 0, 0, 20, 55, 0, 0, 52, 0, 32, 0, 44, 17, 20, 0, 36, 26, 0, 50, 52, 21, 38, 67, 20, 0, 0, 9, 20, 0, 4, 59 (list; graph; listen)
OFFSET

1,2

COMMENT

Concatenation always begins at n-1 and cannot go further than n-n (zero). Hence the maximum value of a(n) is n.

EXAMPLE

a(8) = 6 because will divide the number formed by concatenating the 6 integers prior to 8 in descending order (i.e. 765432). 8 will not divide any lesser number of previous terms concatenated together beginning with 7 (i.e. 8 will not divide 7, 76, 765, 7654, or 76543). a(7) = 0 because 7 will not divide 6, 65, 654, 6543, 65432, 654321, or 6543210.

CROSSREFS

Cf. A088798, A088800, A088869, A088871, A088886.

Sequence in context: A131562 A107902 A123914 this_sequence A121358 A112659 A115281

Adjacent sequences: A088882 A088883 A088884 this_sequence A088886 A088887 A088888

KEYWORD

base,nonn

AUTHOR

Chuck Seggelin (barkeep(AT)plastereddragon.com), Oct 29 2003

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 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research