submit this sequence?

[Joerg Arndt]

0, 1, 6, 7, 18, 19, 20, 21, 106, 107, 108, 109, 120, 121, 126, 127,
258, 259, 260, 261, 272, ...

words that, as binary polynomials p(x), are fixed points
of p(x) --> p(x+1)

If p(x) is a fixed point then P(x):=(x+x^2)*p(x) and P(x)+1
are also fixed points.

A function that returns a unique fixed point for each argument:

ulong blue_fixed_point(ulong s)
{
    if ( 0==s )  return 0;
    ulong f = 1;
    while ( s>1 )
    {
        f ^= (f<<1);
        f <<= 1;
        f |= (s&1);
        s >>= 1;
    }
    return f;
}


Worth to submit?


-- 
p=2^q-1 prime <== q>2, cosh(2^(q-2)*log(2+sqrt(3)))%p=0
Life is hard and then you die.