login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134162 Let S(k) be the sequence s() defined by s(1) = k; for i>1, s(i) = s(i-1) + gcd(s(i-1), i). Start with the list of natural numbers and remove any k's for which S(k) merges with an S(m) with m < k. This sequence gives conjectural values for the remaining k's. 14
1, 2, 4, 8, 16, 20, 44, 92, 110, 136, 152, 170, 172, 188, 200, 212, 236, 242, 256, 272, 316, 332, 368, 440, 488, 500, 590, 616, 620, 632, 650, 676, 704, 710, 742, 788, 824, 848, 892, 946, 952, 968, 1010, 1034, 1036, 1052, 1058, 1088, 1118 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

In other words, these are conjectural initial values k for which the sequences S(k) never merge. The resulting S(k) have been checked to be distinct for 2^60 terms, but it is possible that they merge later on.

LINKS

Table of n, a(n) for n=1..49.

CROSSREFS

Cf. A084662, A084663, A106108 and other sequences mentioned in A106108.

Sequence in context: A166156 A089473 A118021 * A045776 A102252 A174838

Adjacent sequences:  A134159 A134160 A134161 * A134163 A134164 A134165

KEYWORD

nonn

AUTHOR

Eric Rowland, Jan 29 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified June 19 05:13 EDT 2013. Contains 226390 sequences.