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.

A186201 Consider all ways of writing 2n = p + q where p, q are primes, p <= n and q >= n; let s1(n) = sum of the p's and s2(n) = sum of the q's; the sequence lists the integers 2n for which s1(n) divides s2(n).

Table of values

n a(n)
1 4
2 6
3 16
4 18
5 20
6 32
7 52
8 72
9 102
10 180
11 3212

List of values

[4, 6, 16, 18, 20, 32, 52, 72, 102, 180, 3212]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.