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.

A307589 Numbers m such that 1 < gcd(m, 35) < m and m does not divide 35^e for e >= 0.

Original entry on oeis.org

10, 14, 15, 20, 21, 28, 30, 40, 42, 45, 50, 55, 56, 60, 63, 65, 70, 75, 77, 80, 84, 85, 90, 91, 95, 98, 100, 105, 110, 112, 115, 119, 120, 126, 130, 133, 135, 140, 145, 147, 150, 154, 155, 160, 161, 165, 168, 170, 180, 182, 185, 189, 190, 195, 196, 200, 203, 205
Offset: 1

Views

Author

Michael De Vlieger, Aug 22 2019

Keywords

Comments

Complement of the union of A003595 and A235933.
Analogous to A081062 and A105115 for terms 1 and 2 of A120944. This sequence applies to A120944(6) = 35.

Examples

			10 is in the sequence since gcd(10, 35) = 5 and 10 does not divide 35^e with integer e >= 0.
2 is not in the sequence since 2 is coprime to 35.
7 is not in the sequence since 7 | 35.
25 is not in the sequence since 25 | 35^2.
		

Crossrefs

Programs

  • Mathematica
    With[{nn = 205, k = 35}, Select[Range@ nn, And[1 < GCD[#, k] < #, PowerMod[k, Floor@ Log2@ nn, #] != 0] &]]
  • PARI
    is(n)=gcd(n,35)>1 && n/5^valuation(n,5)/7^valuation(n,7)>1 \\ Charles R Greathouse IV, Sep 07 2022

Formula

a(n) = 35n/11 + O(log^2 n). - Charles R Greathouse IV, Sep 07 2022