|
%I #10 Nov 08 2018 21:11:21
%S 1,0,1,1,1,0,0,1,1,0,1,0,1,1,1,1,1,1,0,0,0,1,0,0,1,0,1,0,1,1,0,1,1,0,
%T 0,1,1,1,1,0,1,0,1,1,1,1,1,1,1,0,0,0,0,1,1,0,0,0,1,0,1,0,0,1,1,1,0,0,
%U 1,1,0,1,0,0,1,0,1,0,1,1,0,1,1,0
%N a(1)=1. For n >= 1, if a(n) = 0, then append to the sequence the digits of binary n+1 (most significant digits first and least significant digits last). If a(n) = 1, then append to the sequence the digits of binary n+1 in reverse order (least significant digits first and most significant digits last).
%H Rémy Sigrist, <a href="/A175479/b175479.txt">Table of n, a(n) for n = 1..10000</a>
%o (PARI) a=[1]; for (n=1, 84, print1 (a[n] ", "); if (#a<84, a=concat(a, if (a[n], Vecrev(binary(n+1)), binary(n+1))))) \\ _Rémy Sigrist_, Nov 08 2018
%Y Cf. A175480.
%K base,nonn
%O 1,1
%A _Leroy Quet_, May 25 2010
%E Definition fixed by _Leroy Quet_, May 28 2010
|
