[seqfan] Re: An arithmetic conjecture

[Robert Gerbicz]

2009/3/5 Peter Luschny <peter.luschny at googlemail.com>

> Start M[1] = 1, K[1] = 0. For given m > 1
> let s(m) denote the smallest k such that
> the conjecture holds - assuming existence -
> or 0 if not. Further let t(m) be the maximum
> of the s(i) for all i <= m.
>
> Now list those pairs m,t(m) where t(m) increases.
>

Your sequence has errors, here it is a correction and extension of the
sequence:
M K
1 0
5 2
8 3
19 5
21 12
27 15
49 21
110 29
118 34
165 58
2769 61
2837 65
3661 70
14354 74
59913 103
1786453 112
2702893 117
2712849 121
7384247 122
21219075 130
193702717 153
899019601 156
1305797743 159