|
|
A160509
|
|
Decimal expansion of 1/log(phi).
|
|
1
|
|
|
2, 0, 7, 8, 0, 8, 6, 9, 2, 1, 2, 3, 5, 0, 2, 7, 5, 3, 7, 6, 0, 1, 3, 2, 2, 6, 0, 6, 1, 1, 7, 7, 9, 5, 7, 6, 7, 7, 4, 2, 1, 9, 2, 2, 6, 7, 7, 8, 3, 2, 8, 3, 4, 8, 0, 2, 7, 8, 1, 3, 9, 9, 2, 1, 9, 1, 9, 7, 4, 3, 8, 6, 9, 2, 8, 5, 5, 3, 5, 4, 0, 9, 0, 1, 4, 4, 5, 6, 1, 5, 4, 1, 4, 4, 5, 3, 6, 0, 4, 8, 2, 1, 9, 3, 3
(list;
constant;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
REFERENCES
|
D. E. Knuth, The Art of Computer Programming, Vol 1: Fundamental Algorithms, Addison-Wesley, 1968, Appendix B, Table 1.
|
|
LINKS
|
J. D. Cloud, Probelm E 1636, The American Mathematical Monthly, Vol. 70, No. 9 (1963), p. 1005; Number of Fibonacci Numbers Not Exceeding N, Solution to Problem E 1636 by William D. Jackson, ibid., Vol. 71, No. 7 (1964), p. 798.
Douglas Lind, Problem H-74, Advanced Problems and Solutions, The Fibonacci Quarterly, Vol. 3, No. 4 (1965), p. 300; A Better Problem Solution, Solution to Problem H-74, ibid., Vol. 4, No. 1 (1966), pp. 58-59.
|
|
FORMULA
|
Equals lim_{n->oo} A072649(n)/log(n) (Cloud, 1963). (End)
|
|
EXAMPLE
|
2.07808692123502753760132260611779576774219226778328...
|
|
MATHEMATICA
|
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|