submit this sequence?

[Joerg Arndt]

* Joerg Arndt <arndt at jjj.de> [May 19. 2006 10:12]:
> 
> 0, 1, 6, 7, 18, 19, 20, 21, 106, 107, 108, 109, 120, 121, 126, 127,
> 258, 259, 260, 261, 272, ...

> [...]

> Worth to submit?

Done (as Neil said "yes").

With similar seqs: ask on the list first?

Alternativly I'd like to have a field in the form that is a remark for the editor
(where I'd routinely say: "discard if not interesting enough").
Such a field might be useful for other pertinent remarks, too.

Hope I did it right:
-------------------------------------------
%I A000001
%S A000001 0 1 6 7 18 19 20 21 106 107 108 109 120 121 126 127 258 259 260 261 272 273 278 279 360 361 366 367 378 379 380 381 1546 1547 1548 1549 1560 1561 1566 1567 1632 1633 1638 1639 1650 1651 1652 1653 1800 1801 1806 1807 1818 1819 1820 1821 1890 1891 1892 1893 1904 1905 1910 1911
%N A000001 Words that, as binary polynomials p(x), are fixed points of p(x) --> p(x+1)
%C A000001 If p(x) is a fixed point then P(x):=(x+x^2)*p(x) and P(x)+1 are also fixed points.
%H A000001 Joerg Arndt <a href="http://www.jjj.de/fxt/#fxtbook">fxtbook</a>, section "Invertible transforms on words" in chapter "Bit wizardry"
%o A000001 // C++ function that returns a unique fixed point for each argument:

ulong A(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;
}
// the elements are not produced in increasing order, but as follows
// 0 1 6 7 20 18 21 19 120 108 126 106 121 109 127 107 272 360 ...
%O A000001 0
%K A000001 ,base,nonn,
%A A000001 Joerg Arndt (arndt at jjj.de), May 19 2006
-------------------------------------------