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.

A242974 Let M_n = A002110(n) (the n-th primorial), let N*(n)(N**(n), respectively) be the number of numbers k in [1, M_n] for which lpf(k-3) > lpf(k-1) >= prime(n) (lpf(k-1) > lpf(k-3) >= prime(n), respectively) such that k-3, k-1 are not twin primes, where lpf=least prime factor. Then a(n) = N*(n) - N**(n).

Table of values

n a(n)
3 1
4 1
5 3
6 25
7 67
8 131
9 1556
10 -1671

List of values

[1, 1, 3, 25, 67, 131, 1556, -1671]

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

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