|
|
A123507
|
|
Lengths of bit runs in A123506.
|
|
3
|
|
|
1, 2, 1, 3, 1, 1, 2, 2, 3, 2, 4, 3, 5, 5, 5, 7, 8
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,2
|
|
COMMENTS
|
The sequence uses operations based on the second nontrivial Riemann zero: (1/2 + i*t), t = 21.022039639... A123504 and A123505 use the first nontrivial zero.
|
|
REFERENCES
|
John Derbyshire, Prime Obsession, Bernhard Riemann and the Greatest Unsolved Problem in Mathematics, Plume - a Penguin Group, NY, 2003, pp. 198-199.
|
|
LINKS
|
|
|
FORMULA
|
Record the numbers of consecutive bit runs of A123506.
|
|
EXAMPLE
|
a(4) = 3 since A123506 = 0, 1, 1, 0, 1, 1, 1, ...
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|