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.

Showing 1-2 of 2 results.

A296469 Decimal expansion of ratio-sum for A295862; see Comments.

Original entry on oeis.org

3, 8, 7, 0, 2, 3, 6, 0, 7, 9, 7, 9, 5, 9, 5, 9, 3, 2, 3, 2, 8, 2, 0, 5, 2, 3, 1, 1, 7, 8, 3, 9, 9, 5, 0, 1, 3, 8, 5, 6, 7, 3, 9, 8, 3, 0, 0, 9, 7, 2, 3, 1, 9, 9, 4, 3, 0, 1, 0, 8, 7, 6, 5, 5, 9, 5, 8, 0, 5, 4, 5, 4, 0, 6, 7, 3, 8, 5, 3, 9, 0, 5, 8, 8, 6, 2
Offset: 1

Views

Author

Clark Kimberling, Dec 18 2017

Keywords

Comments

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 = A295862, we have g = (1 + sqrt(5))/2, the golden ratio (A001622). See A296425-A296434 for related ratio-sums and A296452-A296461 for related limiting power-ratios. Guide to more ratio-sums and limiting power-ratios:
****
Sequence A ratio-sum for A limiting power-ratio for A

Examples

			ratio-sum = 6.21032710946618494227967...
		

Crossrefs

Programs

  • Mathematica
    a[0] = 1; a[1] = 3; b[0] = 2; b[1 ] = 4; b[2] = 5;
    a[n_] := a[n] = a[n - 1] + a[n - 2] + b[n];
    j = 1; While[j < 13, k = a[j] - j - 1;
    While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++];
    Table[a[n], {n, 0, k}]; (* A295862 *)
    g = GoldenRatio; s = N[Sum[- g + a[n]/a[n - 1], {n, 1, 1000}], 200]
    Take[RealDigits[s, 10][[1]], 100]  (* A296469 *)

A296490 Decimal expansion of limiting power-ratio for A293358; see Comments.

Original entry on oeis.org

5, 7, 9, 2, 4, 9, 7, 4, 8, 4, 5, 2, 1, 0, 7, 5, 8, 9, 2, 7, 4, 7, 7, 3, 8, 0, 7, 5, 8, 8, 2, 8, 6, 7, 0, 1, 6, 8, 2, 2, 1, 4, 0, 8, 1, 7, 6, 5, 1, 7, 1, 8, 4, 0, 3, 6, 8, 7, 8, 9, 0, 1, 1, 6, 2, 1, 6, 4, 9, 0, 0, 2, 9, 3, 3, 6, 0, 6, 8, 1, 1, 4, 4, 6, 9, 4
Offset: 1

Views

Author

Clark Kimberling, Dec 19 2017

Keywords

Comments

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 limiting power-ratio for A is the limit as n->oo of a(n)/g^n, assuming that this limit exists. For A = A293358, we have g = (1 + sqrt(5))/2, the golden ratio (A001622). See the guide at A296469 for related sequences.

Examples

			limiting power-ratio = 5.792497484521075892747738075882867016822...
		

Crossrefs

Programs

  • Mathematica
    a[0] = 1; a[1] = 3; b[0] = 2; b[1 ] = 4;
    a[n_] := a[n] = a[n - 1] + a[n - 2] + b[n - 1];
    j = 1; While[j < 13, k = a[j] - j - 1;
    While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++];
    Table[a[n], {n, 0, k}]; (* A293358 *)
    z = 2000; g = GoldenRatio; h = Table[N[a[n]/g^n, z], {n, 0, z}];
    StringJoin[StringTake[ToString[h[[z]]], 41], "..."]
    Take[RealDigits[Last[h], 10][[1]], 120]   (* A296490 *)
Showing 1-2 of 2 results.