|
Search: id:A143257
|
|
|
| A143257 |
|
Sequence of sum of Gray code Binary digits for Factorial sequence : a(n)=GrayCodeBinarySum[n!). |
|
+0
2
|
|
| 1, 1, 3, 3, 15, 45, 441, 441, 3213, 16059, 172569, 517671, 6695325, 43746885, 903732249, 903732249, 14611840389, 110769926061, 1248788195355, 12439562858721, 154437141889677, 1902100636851663, 51339101124195573
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
Weisstein, Eric W. "Gray Code." http : // mathworld.wolfram.com/GrayCode.html
|
|
FORMULA
|
a(n)=GrayCodeBinarySum[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[n! ]; a0 = Table[Sum[a[n][[m + 1]]*2^m, {m, 0, Length[a[n]] - 1}], {n, 1, 200}]
|
|
CROSSREFS
|
Cf. A098957.
Sequence in context: A067655 A049606 A046126 this_sequence A089403 A111674 A048234
Adjacent sequences: A143254 A143255 A143256 this_sequence A143258 A143259 A143260
|
|
KEYWORD
|
nonn,uned,probation
|
|
AUTHOR
|
Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Oct 21 2008
|
|
|
Search completed in 0.002 seconds
|
