login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A143250 Sequence of sum of Gray code Binary digits for Fibonacci sequence A000045: a(n)=GrayCodeBinarySum[A000045(n)). 0
1, 1, 1, 3, 5, 1, 11, 21, 17, 59, 77, 9, 151, 317, 281, 879, 1507, 389, 5441, 5835, 4309, 31313, 18427, 1197, 69961, 71863, 68605, 423129, 354527, 83155, 1534501, 2633505, 1177835, 7573621, 9646897, 887751, 20771357, 38811817, 18203279, 110884035 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

This sequence does not match its definition. - Franklin T. Adams-Watters, Sep 29 2011.

LINKS

Eric Weisstein's World of Mathematics, Gray Code

FORMULA

a(n)=GrayCodeBinarySum[A000045(n)).

MATHEMATICA

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 ]; a[n_] = GrayCodeList[Fibonacci[n]];; a0 = Table[Sum[a[n][[m + 1]]*2^m, {m, 0, Length[a[n]] - 1}], {n, 1, 200}]

CROSSREFS

Cf. A098957, A000045.

Sequence in context: A026253 A138259 A077021 * A174883 A084833 A204020

Adjacent sequences:  A143247 A143248 A143249 * A143251 A143252 A143253

KEYWORD

nonn,uned,obsc,base

AUTHOR

Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Oct 21 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.