This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A143332 #27 Jan 09 2021 20:44:29
%S A143332 0,1,1,3,2,7,12,11,31,51,44,117,216,157,453,851,566,803,788,127,859,
%T A143332 931,440,521,432,409,809,739,458,239,828,947,391,531,148,173,360,837,
%U A143332 61,1011,942,475,36,375,307,579,496,145,864,689,465
%N A143332 Related to Gray code representation of Fibonacci(n) in base 10.
%C A143332 This is not A003188(A000045(n)) for n >= 17. - Jose-Angel Oteo, Mar 09 2015
%C A143332 The Gray code of Fibonacci(n) is now listed in A255919 = A003188 o A000045. It would be appreciated to know the precise definition of the present sequence, presumably computed via the incomplete and somewhat obscure Mathematica code given below. In view of the definition, might it be related to the decimal Gray code A003100 or another variant? _R. J. Mathar_ remarks that A143214 and A143210 have Mathematica code of a two-argument GrayCode[] function. - _M. F. Hasler_, Mar 11 2015
%t A143332 GrayCodeList[k_] := Module[{b = IntegerDigits[k, 2], i}, Do[ If[b[[i - 1]] == 1, b[[i]] = 1 - b[[i]]], {i, Length[b], 2, -1} ]; b ]; FromGrayCodeList[d_] := Module[{b = d, i, j}, Do[ If[Mod[Sum[b[[j]], {j, i - 1}], 2] == 1, b[[i]] = 1 - b[[i]]], {i, n = Length[d], 2, -1} ]; FromDigits[b, 2] ]; GrayCode[i_, n_] :=
%Y A143332 Cf. A255919, A003188, A000045, A003100, A143214, A143210.
%K A143332 nonn,obsc
%O A143332 0,4
%A A143332 _Roger L. Bagula_ and _Gary W. Adamson_, Oct 21 2008
%E A143332 Edited by _M. F. Hasler_, Mar 11 2015