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.

A076517 Partial sums of A060370 (cf. A006556).

Original entry on oeis.org

1, 6, 8, 9, 10, 11, 12, 14, 26, 34, 36, 37, 41, 42, 43, 45, 47, 56, 62, 64, 66, 67, 92, 95, 97, 98, 99, 102, 103, 120, 123, 124, 126, 128, 130, 131, 135, 136, 137, 139, 140, 142, 144, 151, 152, 154, 155, 156, 190, 198, 203, 204, 205, 206, 260, 264, 274, 276, 278
Offset: 1

Views

Author

Benoit Cloitre, Nov 09 2002

Keywords

Formula

a(n) seems to be asymptotic to c*n*log(n) with 0.5 < c < 1

A359446 a(n) is the period of the decimal expansion of 1/A243110(n).

Original entry on oeis.org

1, 2, 3, 4, 7, 5, 21, 29, 20, 22, 7, 10, 11, 18, 35, 51, 45, 61, 9, 11, 14, 17, 15, 16, 21, 47, 51, 54, 55, 24, 28, 37, 13, 44, 44, 26, 17
Offset: 1

Views

Author

Pedro K. Krause, Jan 01 2023

Keywords

Comments

Equivalently, a(n) is the period of the decimal expansion of the reciprocals of the corresponding primes in the records of A060370, that is, of the primes that set a record for the ratio between them and the period of its reciprocal.

Examples

			a(5) = 7 because the 5th term of A243110 is 239 and 1/239 = 0.0041841... which has a period of 7.
		

Crossrefs

Programs

  • Python
    from sympy import n_order, nextprime
    p = 3
    best = 0
    while True:
        if p!=5:
            period = n_order(10,p)
            k = (p-1)//period
            if k > best:
                best = k
                print(period, end=',')
        p = nextprime(p)
Showing 1-2 of 2 results.