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.

A195118 Numbers with largest and smallest prime factors differing by 6.

Original entry on oeis.org

55, 91, 187, 247, 275, 385, 391, 605, 637, 667, 1001, 1147, 1183, 1375, 1591, 1925, 1927, 2057, 2431, 2491, 2695, 3025, 3127, 3179, 3211, 4087, 4199, 4235, 4459, 4693, 4891, 5767, 6647, 6655, 6875, 7007, 7387, 7429, 8281, 8993, 9625, 9991, 10807, 11011
Offset: 1

Views

Author

Reinhard Zumkeller, Sep 13 2011

Keywords

Examples

			a(10) = 667 = 23 * 29;
a(11) = 1001 = 7 * 11 * 13;
a(12) = 1147 = 31 * 37;
a(13) = 1183 = 7 * 13^2.
		

Crossrefs

Cf. A195106, A111192; A143205 is a subsequence.

Programs

  • Haskell
    a195118 n = a195118_list !! (n-1)
    a195118_list = filter f [3,5..] where
       f x = last pfs - head pfs == 6 where pfs = a027748_row x
  • Mathematica
    spf6Q[n_]:=With[{fi=FactorInteger[n]},fi[[-1,1]]-fi[[1,1]]==6]; Select[Range[12000],spf6Q] (* Harvey P. Dale, May 14 2024 *)