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.

Showing 1-1 of 1 results.

A354562 Numbers k such that k and k+1 are both divisible by the cube of their largest prime factor.

Original entry on oeis.org

6859, 11859210, 18253460, 38331320423, 41807225999, 49335445119, 50788425848, 67479324240, 203534609200, 245934780371, 250355343420, 581146348824, 779369813871, 1378677994836, 2152196307260, 2730426690524, 3616995855087, 5473549133744, 6213312123347, 6371699408179, 8817143116903
Offset: 1

Views

Author

Amiram Eldar, May 30 2022

Keywords

Comments

Numbers k such that P(k)^3 | k and P(k+1)^3 | (k+1), where P(k) = A006530(k).
a(1)-a(5) and a(7) are from De Koninck (2009).

Examples

			6859 = 19^3 is a term since P(6859) = 19 and 19^3 | 6859, 6860 = 2^2 * 5 * 7^3, P(6860) = 7 and 7^3 | 6860.
		

Crossrefs

Subsequence of A070003, A354558 and A354561.
Intersection of A354563 and A354564.

Programs

  • Mathematica
    q[n_] := FactorInteger[n][[-1, 2]] > 2; Select[Range[2*10^7], q[#] && q[# + 1] &]
  • Python
    from sympy import factorint
    def c(n): f = factorint(n); return f[max(f)] >= 3
    def ok(n): return n > 1 and c(n) and c(n+1)
    print([k for k in range(10**5) if ok(k)]) # Michael S. Branicky, May 30 2022

Extensions

a(6) and more terms from David A. Corneth, May 30 2022
Showing 1-1 of 1 results.