|
Search: id:A092874
|
|
|
| A092874 |
|
Decimal expansion of the "binary" Liouville number. |
|
+0
11
|
|
| 7, 6, 5, 6, 2, 5, 0, 5, 9, 6, 0, 4, 6, 4, 4, 7, 7, 5, 3, 9, 0, 6, 2, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 5, 2, 3, 1, 6, 3, 8, 4, 5, 2, 6, 2, 6, 4, 0, 0, 5, 0, 9, 9, 9, 9, 1, 3, 8, 3, 8, 2, 2, 2, 3, 7, 2, 3, 3, 8, 0, 3
(list; cons; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The famous Liouville number is defined so that its n-th fractional decimal digit is 1 iff there exists k, such that k!=n.
The binary Liouville number is defined similarly, but as a binary number:its n-th fractional binary digit is 1 iff there exists k, such that k!=n.
According to the definitions introduced in A092855 and A051006, this number is "the binary mapping" of the sequence of factorials (Axxx).
|
|
LINKS
|
Ferenc Adorjan, Binary mapping of monotonic sequences and the Aronson function
|
|
PROGRAM
|
(PARI) { mt(v)= /*Returns the binary mapping of v monotonic sequence as a real in (0, 1)*/
local(a=0.0, p=1, l); l=matsize(v)[2];
for(i=1, l, a+=2^(-v[i])); return(a)}
|
|
CROSSREFS
|
Cf. A092855, A051006.
Sequence in context: A074921 A120634 A104178 this_sequence A015791 A059751 A019859
Adjacent sequences: A092871 A092872 A092873 this_sequence A092875 A092876 A092877
|
|
KEYWORD
|
easy,nonn,cons
|
|
AUTHOR
|
Ferenc Adorjan (fadorjan(AT)freemail.hu)
|
|
|
Search completed in 0.002 seconds
|
