Observations on A100004

[JEREMY GARDINER]

It appears that, taking A100004:
a(n) = (-1/n), where (k/n) is the Kronecker symbol

and replacing +1 with 0 and -1 with 1, we obtain A038189:
Bit to left of least significant bit in binary expansion of n.

Alternatively, replacing -1 with 0 we obtain (allowing for offset) A014577:
The regular paper-folding (or dragon curve) sequence.


Jeremy Gardiner
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20041108/9f0b11f3/attachment-0001.htm>