[seqfan] Re: Need help reverse engineering sequence from Per Noergard

[jean-paul allouche]

Dear Neil, dear all

Right! Btw I should have cited another paper of Shallit on this,
namely https://www.tandfonline.com/doi/full/10.1080/17459737.2017.1299807

best
jean-paul

Le 31/12/2018 à 08:07, Neil Sloane a écrit :
> Jon, Jean-Paul:
>
> A004718 has a formula,
>
> a(n) = (2 * (n mod 2) - 1) * a(floor(n/2)) + n mod 2. - _Reinhard
> Zumkeller_, Mar 20 2015
>
> which implies a(2n) = -a(n) and so a(n) = a(4n) = a(16n) = ...
>
>
>
> On Sun, Dec 30, 2018 at 6:34 PM Jon Wild <wild at music.mcgill.ca> wrote:
>
>> On Sun, 30 Dec 2018, Neil Sloane wrote:
>>
>>> I'll also add a comment about the fractal-like property of the infinity
>>> sequence (based on taking every 16-th term), which was new to me.
>> Better check it first, beyond the first few values! (I only checked as far
>> as the included part of the sequence in the A-file)
>>
>> Jon
>>
>>
>>
>>
>> --
>> Seqfan Mailing list - http://list.seqfan.eu/
>>
> --
> Seqfan Mailing list - http://list.seqfan.eu/