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.

A368424 Numbers k such that gcd(A019320(k), A019321(k)) > 1.

Original entry on oeis.org

4, 11, 18, 20, 23, 28, 35, 43, 48, 52, 83, 95, 100, 119, 131, 138, 148, 155, 162, 166, 172, 179, 191, 196, 204, 210, 214, 239, 251, 253, 268, 292, 299, 300, 316, 323, 342, 359, 371, 378, 388, 419, 431, 443, 460, 463, 491, 500, 508, 515, 537, 556, 564, 575
Offset: 1

Views

Author

Tomohiro Yamada, Dec 24 2023

Keywords

Comments

The corresponding greatest common divisors are given in A368425.

Examples

			a(1) = 4 since A019320(4) = 5 and A019321(4) = 10.
		

Crossrefs

Cf. A019320, A019321, A191609 (prime factors of such gcds), A368425.

Programs

  • Maple
    select(k -> igcd(numtheory:-cyclotomic(k,2),
    numtheory:-cyclotomic(k,3)) > 1, [$1..1000]); # Robert Israel, Dec 26 2023
  • Mathematica
    Select[Range[600],GCD[Cyclotomic[#,2],Cyclotomic[#,3]]>1&] (* Stefano Spezia, Dec 26 2023 *)
  • PARI
    for(n=1,1000,if(gcd(polcyclo(n,2),polcyclo(n,3))>1,print1(n,", ")))
Showing 1-1 of 1 results.