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.

A244332 Position of the incrementally largest term in the continued fraction for the base 3 Champernowne constant (A077772).

Original entry on oeis.org

1, 2, 4, 5, 7, 19, 39, 121, 321, 813, 2063, 4957, 11731, 26329, 59501, 132273, 294475, 644557, 1392933, 2982557
Offset: 1

Views

Author

John K. Sikora, Jun 26 2014

Keywords

Crossrefs

Cf. A077772 (Continued fraction expansion of the ternary Champernowne constant.)
Cf. A244757 (Incrementally largest terms in the continued fraction for the base 3 Champernowne constant.)
Cf. A244333 (Number of ternary digits in the high-water marks of the terms of the continued fraction of the base 3 Champernowne constant.)

A244333 Number of ternary digits in the high-water marks of the terms of the continued fraction of the base 3 Champernowne constant (A077772).

Original entry on oeis.org

0, 1, 1, 4, 5, 33, 139, 515, 1809, 6181, 20759, 68871, 226333, 738089, 2391459, 7705867, 24711977, 78918957, 251105839
Offset: 1

Views

Author

John K. Sikora, Jun 27 2014

Keywords

Crossrefs

Cf. A077772 (Continued fraction expansion of the ternary Champernowne constant.)
Cf. A244757 (Incrementally largest terms in the continued fraction for the base 3 Champernowne constant.)
Cf. A244332 (Position of the incrementally largest term in the continued fraction for the base 3 Champernowne constant.)

Programs

  • Ruby
    puts (5..19).collect {|n| (1..(n-3)).inject(0) {|sum, m| sum+2*m*3**(m-1)}+3-n-2*((1..(n-4)).inject(0) {|sum1, m1| sum1+2*m1*3**(m1-1)}+3-(n-1))-3*(n-2)+4}

Formula

It appears that: Define NCD(N)=3-N+(sum{m=1..(N-3)} 2*m*3^(m-1)); then for n>=5, a(n) = NCD(n)-2*NCD(n-1)-3*(n-2)+4.
Showing 1-2 of 2 results.