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.

A246135 Primes that are palindromic right angle numbers in base 9.

Original entry on oeis.org

173, 191, 373, 719, 50767, 1270271, 30890747159
Offset: 1

Views

Author

Chai Wah Wu, Aug 15 2014

Keywords

Examples

			50767 is in the list since it is prime and is equal to 76567 in base 9.
		

Crossrefs

Programs

  • Python
    from sympy import isprime
    A246135 = []
    for n in range(1,9):
        for m in range(n-1, -1, -1):
            l = ''.join([str(d) for d in range(n, m-1, -1)])
            p = int(l+l[-2::-1], 9)
            if isprime(p):
                A246135.append(p)
        for m in range(n+1, 9):
            l = ''.join([str(d) for d in range(n, m+1)])
            p = int(l+l[-2::-1], 9)
            if isprime(p):
                A246135.append(p)
    A246135 = sorted(A246135)

A246136 Numbers that are palindromic right angle numbers in base 8.

Original entry on oeis.org

211, 227, 373, 503, 32119, 856147, 2054519, 131479927
Offset: 1

Views

Author

Chai Wah Wu, Aug 15 2014

Keywords

Examples

			856147 is in the list since it is prime and is equal to 3210123 in base 8.
		

Crossrefs

Programs

  • Python
    from sympy import isprime
    A246136 = []
    for n in range(1,8):
        for m in range(n-1,-1,-1):
            l = ''.join([str(d) for d in range(n,m-1,-1)])
            p = int(l+l[-2::-1],8)
            if isprime(p):
                A246136.append(p)
        for m in range(n+1,8):
            l = ''.join([str(d) for d in range(n,m+1)])
            p = int(l+l[-2::-1],8)
            if isprime(p):
                A246136.append(p)
    A246136 = sorted(A246136)
Showing 1-2 of 2 results.