Sequences that pass recursion test, but ...

[Max Alekseyev]

On 3/2/07, Max Alekseyev <maxale at gmail.com> wrote:

> > >btw, in your NonRecursions.html I noticed a lot of sequences of the type:
> > >"Numbers n such that string x,y occurs in the base b representation of
> > >n but not of n-1."
> > >They all are not recursive, you can remove (or mark as non-recursive)
> > >them all together.
> > >
> >
> > I understand that they are not recursive. I hope someone would submit the first deviation from recursion they way you calculated for one of them. It would be nice to have an explicit statement about that in OEIS.

> If at least one of x,y is non-zero then the first deviation is
> x*b^3+y*b^2+x*b+y=(x*b+y)*(b^2+1).

Actually, the above is about distinct x and y.
If x=y is non-zero then the first deviation is x*(b^2+b+1).

> If x=y=0 then the first deviation is b^4+b^2=b^2*(b^2+1).

Max