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.

A317336 a(n) = A317333(n) - 8*n.

Original entry on oeis.org

-7, -10, -10, -7, -10, -10, -7, -7, -10, -10, -10, -7, -7, -10, -7, -7, -10, -10, -10, -7, -10, -10, -7, -7, -7, -10, -10, -7, -7, -10, -7, -7, -10, -10, -10, -7, -10, -10, -7, -7, -10, -10, -10, -7, -7, -10, -7, -7, -7, -10, -10, -7, -10, -10, -7, -7, -7, -10, -10, -7, -7, -10, -7, -7
Offset: 1

Views

Author

A.H.M. Smeets, Jul 26 2018

Keywords

Crossrefs

Programs

  • Python
    n, f, i, p, q = 1, 1, 0, 0, 1
    while i < 1000000:
        i, p, q = i + 1, p * 10, q * 10
        if i == f:
            p, n = p + 1, n + 1
            f = f * n
    n, a, j = 0, 0, 0
    while p % q > 0:
        a, f, p, q = a + 1, p // q, q, p % q
        if f == 9:
            n = n + 1
            print(n, a - 1 - 8 * n)

Formula

a(4*n+4) = -7, a(4*n+2) = -10, for n > 0. a(1) = -7 and a(2*n-1) = a(n) for n > 1.
abs(a(n+2)+8) = A014710(n) for n >= 0.
a(n) = -7-3*A082410(n)