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.

A296567 Decimal expansion of ratio-sum for A294557; see Comments.

This page as a plain text file.
%I A296567 #7 Jul 25 2021 20:58:27
%S A296567 2,5,7,4,4,0,8,8,8,8,0,8,2,8,3,1,2,7,2,2,8,3,7,4,1,4,2,9,6,1,9,1,8,4,
%T A296567 7,7,2,6,6,1,4,3,0,6,1,4,8,8,5,1,5,4,4,4,2,3,2,7,1,0,1,7,1,6,2,6,4,2,
%U A296567 0,0,4,7,8,5,2,3,5,8,5,6,7,8,8,8,0,4
%N A296567 Decimal expansion of ratio-sum for A294557; see Comments.
%C A296567 Suppose that A = (a(n)), for n >= 0, is a sequence, and g is a real number such that a(n)/a(n-1) -> g. The ratio-sum for A is |a(1)/a(0) - g| + |a(2)/a(1) - g| + ..., assuming that this series converges. For A = A294557, we have g = (1 + sqrt(5))/2, the golden ratio (A001622). See the guide at A296469 for related sequences.
%e A296567 2.574408888082831272283741429619184772661...
%t A296567 a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4; b[2] = 5;
%t A296567 a[n_] := a[n] = a[n - 1] + a[n - 2] + b[n - 1] + b[n - 2] - n;
%t A296567 j = 1; While[j < 13, k = a[j] - j - 1;
%t A296567 While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++];
%t A296567 Table[a[n], {n, 0, k}]; (* A294557 *)
%t A296567 g = GoldenRatio; s = N[Sum[- g + a[n]/a[n - 1], {n, 1, 1000}], 200]
%t A296567 Take[RealDigits[s, 10][[1]], 100]  (* A296567 *)
%Y A296567 Cf. A001622, A294557, A296469, A296568.
%K A296567 nonn,easy,cons
%O A296567 1,1
%A A296567 _Clark Kimberling_, Dec 20 2017