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-2 of 2 results.

A074695 Greatest common divisor of n and floor(n^(1/2))^2.

Original entry on oeis.org

1, 1, 1, 4, 1, 2, 1, 4, 9, 1, 1, 3, 1, 1, 3, 16, 1, 2, 1, 4, 1, 2, 1, 8, 25, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 36, 1, 2, 3, 4, 1, 6, 1, 4, 9, 2, 1, 12, 49, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 64, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 16, 81, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 9, 100
Offset: 1

Views

Author

Reinhard Zumkeller, Sep 03 2002

Keywords

Crossrefs

Programs

  • Haskell
    a074695 n = gcd n $ a048760 n  -- Reinhard Zumkeller, Jun 05 2015
    
  • Mathematica
    Table[GCD[n,Floor[Sqrt[n]]^2],{n,100}] (* Harvey P. Dale, Aug 12 2018 *)
  • PARI
    a(n) = gcd(n, sqrtint(n)^2); \\ Amiram Eldar, Nov 19 2024

Formula

a(n) = GCD(n, A048760(n)).
a(n) = n iff n is a square.
a(A258613(n)) = 1; a(A258614(n)) > 1. - Reinhard Zumkeller, Jun 05 2015

A258614 Numbers m having with the largest square <= m a common divisor > 1.

Original entry on oeis.org

4, 6, 8, 9, 12, 15, 16, 18, 20, 22, 24, 25, 30, 35, 36, 38, 39, 40, 42, 44, 45, 46, 48, 49, 56, 63, 64, 66, 68, 70, 72, 74, 76, 78, 80, 81, 84, 87, 90, 93, 96, 99, 100, 102, 104, 105, 106, 108, 110, 112, 114, 115, 116, 118, 120, 121, 132, 143, 144, 146, 147
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 05 2015

Keywords

Comments

The asymptotic density of this sequence is 1-6/Pi^2 (A229099). - Amiram Eldar, Nov 19 2024

Examples

			a(11) = 24: GCD(24,A048760(24)) = GCD(24,16) = 4 > 1.
a(12) = 25: GCD(25,A048760(25)) = GCD(25,25) = 25 > 1.
GCD(26,A048760(26)) = GCD(26,25) = 1, therefore 26 is not a term.
		

Crossrefs

Cf. A074695, A048760, A229099, A258613 (complement).

Programs

  • Haskell
    a258614 n = a258614_list !! (n-1)
    a258614_list = filter ((> 1) . a074695) [1..]
    
  • Mathematica
    Select[Range[150], !CoprimeQ[#, Floor[Sqrt[#]]^2] &] (* Amiram Eldar, Nov 19 2024 *)
  • PARI
    isok(m) = gcd(m, sqr(sqrtint(m))) > 1; \\ Michel Marcus, Jan 23 2022

Formula

A074695(a(n)) > 1.
Showing 1-2 of 2 results.