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.

A319802 Even numbers without middle divisors.

Original entry on oeis.org

10, 14, 22, 26, 34, 38, 44, 46, 52, 58, 62, 68, 74, 76, 78, 82, 86, 92, 94, 102, 106, 114, 116, 118, 122, 124, 134, 136, 138, 142, 146, 148, 152, 158, 164, 166, 172, 174, 178, 184, 186, 188, 194, 202, 206, 212, 214, 218, 222, 226, 230, 232, 236, 244, 246, 248, 250, 254, 258, 262, 268, 274, 278, 282, 284
Offset: 1

Views

Author

Omar E. Pol, Sep 28 2018

Keywords

Comments

Even numbers k such that the symmetric representation of sigma(k) has an even number of parts.
For the definition of middle divisors, see A067742.
For more information about the symmetric representation of sigma(k) see A237593.
Let p be a prime > 5. Then a(n) is a number of the form m*p where m is an even number < sqrt(p). - David A. Corneth, Sep 28 2018
First differs from A244894 at a(51) = 230. - R. J. Mathar, Oct 04 2018
Is this twice A101550? - Omar E. Pol, Oct 04 2018
This sequence is not twice A101550: first differs at a(57) = 250 != 254 = 2*A101550(57). - Michael S. Branicky, Oct 14 2021

Examples

			10 is in the sequence because it's an even number and the symmetric representation of sigma(10) = 18 has an even number of parts as shown below:
.
.     _ _ _ _ _ _ 9
.    |_ _ _ _ _  |
.              | |_
.              |_ _|_
.                  | |_ _ 9
.                  |_ _  |
.                      | |
.                      | |
.                      | |
.                      | |
.                      |_|
.
		

Crossrefs

Programs

  • Python
    from sympy import divisors
    def ok(n):
        if n < 2 or n%2 == 1: return False
        return not any(n//2 <= d*d < 2*n for d in divisors(n, generator=True))
    print(list(filter(ok, range(285)))) # Michael S. Branicky, Oct 14 2021