|
Search: id:A133358
|
|
|
| A133358 |
|
Real base ten digits of binary sum Padovan(A000931) modulo two as in A011656(n): 0.3622047244094488188976377952752364954992315143865474919037707179914065136472 345329821109771728515625. |
|
+0
1
|
|
| 3, 6, 2, 2, 0, 4, 7, 2, 4, 4, 0, 9, 4, 4, 8, 8, 1, 8, 8, 9, 7, 6, 3, 7, 7, 9, 5, 2, 7, 5, 2, 3, 6, 4, 9, 5, 4, 9, 9, 2, 3, 1, 5, 1, 4, 3, 8, 6, 5, 4, 7, 4, 9, 1, 9, 0, 3, 7, 7, 0, 7, 1, 7, 9, 9, 1, 4, 0, 6, 5, 1, 3, 6, 4, 7, 2, 3, 4, 5, 3, 2, 9, 8, 2, 1, 1, 0, 9, 7, 7, 1, 7, 2, 8, 5, 1, 5, 6, 2, 5
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Suggested by the Wolfram 2,3 universal Turing machine as a minimal vector Markov.
|
|
FORMULA
|
a=Sum[Mod[A000931(n+1),2]/2^(n-1),{n,1,m}]=Sum[A011656(n)/2^(n-1),{n,1,m}]; digits base ten of "a"
|
|
MATHEMATICA
|
(*A011656*) M = {{0, 1, 0}, {0, 0, 1}, {1, 1, 0}}; v[0] = {0, 0, 1}; v[n_] := v[n] = Mod[M.v[n - 1], 2]; a = Table[v[n][[1]], {n, 0, 100}]; RealDigits[Sum[a[[i]]/2^(i - 1), {i, 1, Length[a]}]][[1]]
|
|
CROSSREFS
|
Cf. A011656, A000931.
Sequence in context: A016551 A145896 A120907 this_sequence A058099 A124085 A132120
Adjacent sequences: A133355 A133356 A133357 this_sequence A133359 A133360 A133361
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Oct 26 2007
|
|
|
Search completed in 0.002 seconds
|
