login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258613 Numbers m that are coprime to the largest square <= m, cf. A048760. 3

%I #13 Jun 25 2017 12:36:47

%S 1,2,3,5,7,10,11,13,14,17,19,21,23,26,27,28,29,31,32,33,34,37,41,43,

%T 47,50,51,52,53,54,55,57,58,59,60,61,62,65,67,69,71,73,75,77,79,82,83,

%U 85,86,88,89,91,92,94,95,97,98,101,103,107,109,111,113,117

%N Numbers m that are coprime to the largest square <= m, cf. A048760.

%C A074695(a(n)) = 1.

%H Reinhard Zumkeller, <a href="/A258613/b258613.txt">Table of n, a(n) for n = 1..10000</a>

%e a(8) = 13: GCD(13,A048760(13)) = GCD(13,9) = 1;

%e a(9) = 14: GCD(14,A048760(14)) = GCD(14,9) = 1;

%e but GCD(15,A048760(15)) = GCD(15,9) = 3 > 1, therefore 15 isn't a term.

%t Select[Range[200],CoprimeQ[#,Floor[Sqrt[#]]^2]&] (* _Harvey P. Dale_, Jun 25 2017 *)

%o (Haskell)

%o a258613 n = a258613_list !! (n-1)

%o a258613_list = filter ((== 1) . a074695) [1..]

%o (PARI) isok(n) = gcd(n, sqrtint(n)^2) == 1; \\ _Michel Marcus_, Jun 06 2015

%Y Cf. A074695, A048760, A258614 (complement).

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, Jun 05 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 8 22:43 EDT 2024. Contains 375759 sequences. (Running on oeis4.)