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-3 of 3 results.

A277259 Position of initial digit of first string of n consecutive equal digits in the decimal expansion of the Golden ratio (phi), starting after the decimal point.

Original entry on oeis.org

1, 5, 129, 1216, 6399, 99788, 771950, 771950, 314529194
Offset: 1

Views

Author

Felix Fröhlich, Oct 07 2016

Keywords

Examples

			1205th to 1230th digits of phi are as follows: ...63972321340444494873023154...
The 1216th digit is occupied by the first of four consecutive 4's and there is no earlier occurrence of four or more consecutive equal digits, so a(4) = 1216.
		

Crossrefs

A277532 Position of first occurrence of at least n consecutive equal digits in the decimal expansion of the Euler-Mascheroni constant, starting after the decimal point.

Original entry on oeis.org

0, 1, 72, 2346, 3422, 3892
Offset: 1

Views

Author

Felix Fröhlich, Oct 19 2016

Keywords

Comments

Smallest k such that A001620(k) = A001620(k+m) for all m with 0 <= m < n.

Crossrefs

Programs

  • PARI
    emstring(n) = default(realprecision, n+10); my(x=Euler); floor(x*10^n)
    emdigit(n) = emstring(n)-10*emstring(n-1)
    searchstrpos(n) = my(x=1, i=1); while(1, my(y=x+1); while(emdigit(y)==emdigit(x), y++; i++); if(i >= n, return(x-1)); i=1; x++)
    a(n) = searchstrpos(n)

A277533 Value of decimal number corresponding to the string of equal digits starting at position A277532(n) after the decimal point in the decimal expansion of the Euler-Mascheroni constant.

Original entry on oeis.org

5, 77, 777, 0, 0, 333333
Offset: 1

Views

Author

Felix Fröhlich, Oct 19 2016

Keywords

Crossrefs

Programs

  • PARI
    emstring(n) = default(realprecision, n+10); my(x=Euler); floor(x*10^n)
    emdigit(n) = emstring(n)-10*emstring(n-1)
    searchstrval(n) = my(x=1, i=1); while(1, my(y=x+1); while(emdigit(y)==emdigit(x), y++; i++); if(i >= n, return(emdigit(x)*(10^n-1)/9)); i=1; x++)
    a(n) = searchstrval(n)

Formula

a(n) = A001620(A277532(n)) * A002275(n).
Showing 1-3 of 3 results.