Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 May 26 2017 15:10:56
%S 451,3011,451,115651,451,3011,451,-7229,451,3011,451,-48189,451,3011,
%T 451,-7229,451,3011,451,771011,451,3011,451,-7229,451,3011,451,-48189,
%U 451,3011,451,-7229,451,3011,451,115651,451,3011,451,-7229,451,3011,451,-48189,451,3011,451,-7229
%N Variable terms in period-16 pattern of first differences of binary representation of base i-1 expansion of n.
%C This sequence is very highly structured, but does it have a reasonable description?
%C Presumably, yes: see the comments to A066321. - _Andrey Zabolotskiy_, Feb 06 2017
%D D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, 1969, Vol. 2, p. 172, (Also exercise 16, p. 177, answer, p. 494)
%H Andrey Zabolotskiy, <a href="/A066322/b066322.txt">Table of n, a(n) for n = 0..65535</a>
%e a(0) = A066321(0*16+4) - A066321(0*16+3) = 464 - 13 = 451
%Y Cf. A066321, A282137.
%K base,easy,sign
%O 0,1
%A _Marc LeBrun_, Dec 14 2001