Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129268
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129268 Slowest increasing sequence: the sum of three consecutive terms shares no digit with any of the summands. +0
1
0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 14, 15, 31, 32, 33, 34, 35, 37, 38, 39, 40, 43, 44, 63, 64, 65, 68, 69, 73, 76, 79, 80, 83, 86, 88, 96, 116, 118, 119, 120, 124, 125, 128, 140, 267, 426, 440, 445, 446, 447, 460, 474, 604, 733, 774, 775, 777, 778, 779, 785, 797, 818, 819 (list; graph; listen)
OFFSET

0,3

COMMENT

The sequence is finite and has 112 terms. Max Alekseyev (who computed the sequence together with Peter Pein) proved that 175414854, 415748410 and1631058958 are the last three terms: (Quoting Max Alekseyev) Suppose that the next term is x, then the sum s = 415748410 + 1631058958 + x = 2046807368 + x may contain only decimal digit 2. Therefore all solutions are given by the formula x(k) = 2*(10^k-1)/9 - 2046807368 where k>=10. It is easy to see that while x(10)=175414854 is smaller than 1631058958 (hence it cannot be an element of our sequence), all other x(k) contain a decimal digit 2 which is not allowed: x(11) = 20175414854, x(12) = 220175414854, x(13) = 2220175414854, ... Therefore there is no next term in this sequence. QED. (End of quote)

LINKS

Eric Angelini (eric.angelini(AT)kntv.be), May 25 2007, Table of n, a(n) for n = 0..111

CROSSREFS

Sequence in context: A165256 A175020 A050728 this_sequence A039169 A156068 A039263

Adjacent sequences: A129265 A129266 A129267 this_sequence A129269 A129270 A129271

KEYWORD

base,easy,fini,nonn

AUTHOR

Eric Angelini (eric.angelini(AT)kntv.be), May 25 2007

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 December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research