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.

A038511 Composite numbers with smallest prime factor >= 11.

Original entry on oeis.org

121, 143, 169, 187, 209, 221, 247, 253, 289, 299, 319, 323, 341, 361, 377, 391, 403, 407, 437, 451, 473, 481, 493, 517, 527, 529, 533, 551, 559, 583, 589, 611, 629, 649, 667, 671, 689, 697, 703, 713, 731, 737, 767, 779, 781, 793, 799, 803, 817, 841, 851
Offset: 1

Views

Author

Keywords

Comments

Composite n such that n^6 is congruent to {1, 169} mod 210. All primes > 7 satisfy this condition. - Gary Detlefs, Dec 09 2012

Crossrefs

Cf. A008364.

Programs

  • GAP
    Filtered([11..1000],n->(PowerMod(n,6,210)=1 or PowerMod(n,6,210)=169) and not IsPrime(n)); # Muniru A Asiru, Nov 24 2018
  • Maple
    for n from 1 to 1000 do if (n^6 mod 210 = 1 or n^6 mod 210 = 169) and not isprime(n) then print(n) fi od; # Gary Detlefs, Dec 09 2012
  • Mathematica
    Select[Range[1000], Not[PrimeQ[#]] && FactorInteger[#][[1, 1]] > 7 &] (* Alonso del Arte, Dec 09 2012 *)
  • PARI
    is(n)=gcd(210,n)==1 && !isprime(n) \\ Charles R Greathouse IV, Dec 10 2012
    

Formula

a(n) ~ 4.375n. - Charles R Greathouse IV, Dec 10 2012