# [seqfan] Re: Subtracting or adding n to a(n-1)

Leroy Quet q1qq2qqq3qqqq at yahoo.com
Thu Apr 30 16:13:02 CEST 2009

```

--- On Wed, 4/29/09, Joshua Zucker <joshua.zucker at gmail.com> wrote:
Leroy Quet wrote:
>...
> > Next question: Consider my sequence again, but let
> a(0) = the integer m.
> >
> > We can construct 3 sequences here, where {a_m(k)} is
> my sequence with starting value m:
> >
> > b(m) = the smallest positive integer j such that
> a_m(j) = a_m(k) for some k where 0<=k<j.
> >
> > I think this sequence begins (offset 0):
> > 24,16,21,3,12,..
> > (Not in EIS.)
>
> I don't understand this.  Isn't it true that by
> definition a_m(j)
> never equals a_m(k)?  I'm sure I'm missing something,
> and when you
> explain it I'm happy to write a program to generate more
> terms of
> these if that would be useful.
>
> --Joshua Zucker
>

a_m(k) is allowed to equal a_m(j) after n is ADDED to a(n-1).

Uniqueness is only required after n is subtracted from a(n-1).

Thanks,
Leroy Quet

```