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.

A168629 Numbers n such that n,n+1 and sum of this two numbers have at least 3 distinct prime factors.

Original entry on oeis.org

1105, 1130, 1462, 1644, 1742, 1767, 2014, 2222, 2232, 2260, 2337, 2365, 2397, 2464, 2541, 2667, 2684, 2697, 2702, 2755, 2821, 2914, 3074, 3115, 3195, 3289, 3332, 3477, 3484, 3514, 3552, 3619, 3657, 3685, 3782, 3783, 3842, 3965, 4014, 4088, 4122, 4147, 4277
Offset: 1

Views

Author

Keywords

Examples

			1105 = 5*13*17, 1106 = 2*7*79, 1105 + 1106 = 2211 = 3*11*67.
		

Crossrefs

Programs

  • Maple
    q:= n-> andmap(x-> nops(numtheory[factorset](x))>2, [n, n+1, 2*n+1]):
    select(q, [$1..4600])[];  # Alois P. Heinz, Jun 29 2021
  • Mathematica
    f[n_]:=Length[FactorInteger[n]]; lst={};Do[If[f[n]>=3&&f[n+1]>=3&&f[n+n+1]>=3,AppendTo[lst,n]],{n,8!}];lst