login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258614 Numbers m having with the largest square <= m a common divisor > 1. 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

A074695(a(n)) > 1.

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

EXAMPLE

a(11) = 24: GCD(24,A048760(24)) = GCD(24,16) = 4 > 1;

a(12) = 25: GCD(25,A048760(25)) = GCD(25,25) = 25 > 1;

but GCD(26,A048760(26)) = GCD(26,25) = 1, therefore 26 isn't a term.

PROG

(Haskell)

a258614 n = a258614_list !! (n-1)

a258614_list = filter ((> 1) . a074695) [1..]

CROSSREFS

Cf. A074695, A048760, A258613 (complement).

Sequence in context: A161576 A327446 A100425 * A269131 A130074 A304242

Adjacent sequences:  A258611 A258612 A258613 * A258615 A258616 A258617

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Jun 05 2015

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 08:57 EST 2021. Contains 349484 sequences. (Running on oeis4.)