cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A277313 Decimal expansion of the nested logarithm log(1+log(2+log(3+log(4+...)))).

This page as a plain text file.
%I A277313 #43 Mar 08 2025 01:29:24
%S A277313 8,2,0,3,5,9,8,6,2,2,0,8,7,8,9,7,8,8,4,7,3,4,6,6,7,9,4,9,4,0,6,3,9,1,
%T A277313 5,8,4,1,5,9,0,9,7,5,3,4,1,3,1,6,1,9,3,7,6,5,4,6,8,7,6,7,4,9,4,8,5,0,
%U A277313 2,4,0,7,0,1,9,2,2,9,3,8,4,6,3,2,4,5,1,7,7,4,5,4,4,7,9,2,9,9,2,8,8,2,9,8,2
%N A277313 Decimal expansion of the nested logarithm log(1+log(2+log(3+log(4+...)))).
%C A277313 Found empirically. Logarithms are natural.
%C A277313 Converges to within 10^-4 of the asymptotic value when the innermost term is 7. The first fifteen digits after the decimal point can be found numerically by using 17 nested terms.
%C A277313 No closed form expression is known. Probably transcendental but this is unproved.
%C A277313 Empirically, the number of bits of precision with N as the innermost term is 0.02N^2 + 2.24N - 8.5. This means that using N as the largest innermost term gives (0.02N^2 + 2.24N - 8.5)*(log_10(2)) digits. - _Cade Brown_, Oct 10 2016
%H A277313 Cade Brown, <a href="/A277313/b277313.txt">Table of n, a(n) for n = 0..14997</a>
%e A277313 0.82035986220878978847346679494...
%t A277313 RealDigits[SequenceLimit[N[Table[Log[Fold[#2 + Log[#1] &, Reverse@Range[n]]], {n, 1, 100}], 200]], 10, 105][[1]] (* _Vladimir Reshetnikov_, Oct 11 2016 *)
%t A277313 RealDigits[ Fold[ Log[#1 + #2] &, 0, Reverse[ Range[74]]], 10, 111][[1]] (* _Robert G. Wilson v_, Oct 26 2016 *)
%o A277313 (MATLAB)
%o A277313 x=100;
%o A277313 for i=99:-1:1
%o A277313 x=log(i+x);
%o A277313 end
%o A277313 %the initial value of x can be increased for greater precision, but it converges starting well below 100
%o A277313 (C)
%o A277313 // Computes b bits, and uses MPFR for multiprecision.
%o A277313 #include <mpfr.h>
%o A277313 #include <stdio.h>
%o A277313 #include <math.h>
%o A277313 int main() {
%o A277313     int b=256, i;
%o A277313     int N = 500 + (int)(4 * floor(-56+sqrt(3561+50*b)));
%o A277313     mpfr_t m;
%o A277313     mpfr_init2(m, b);
%o A277313     mpfr_set_ui(m, N, rnd);
%o A277313     for (i = N; i > 0; --i) {
%o A277313         mpfr_log(m, m, MPFR_RNDN);
%o A277313         mpfr_add_ui(m, m, i - 1, MPFR_RNDN);
%o A277313     }
%o A277313     mpfr_printf("\nval %.*Rf\n\n", b - 10, m);
%o A277313     mpfr_clear(m);
%o A277313 } /* _Cade Brown_, Oct 10 2016 */
%Y A277313 Similar in concept to A072449.
%Y A277313 Cf. A278812 (log(2*log(3*log(4*...))), or log(2) + log(log(3) + log(log(4) + ...))).
%K A277313 nonn,cons
%O A277313 0,1
%A A277313 _Alex Klotz_, Oct 09 2016
%E A277313 More digits from _Alois P. Heinz_, Oct 09 2016