Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140269
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140269 A number n is included if GCD((largest divisor of n that is <= sqrt(n)),(smallest divisor of n that is >=sqrt(n))) > 1. +0
2
4, 8, 9, 16, 18, 24, 25, 27, 32, 36, 48, 49, 50 (list; graph; listen)
OFFSET

1,1

EXAMPLE

The divisors of 48 are 1,2,3,4,6,8,12,16,24,48. The middle two of these divisors are 6 and 8, which are not coprime. So 48 is included in this sequence.

CROSSREFS

Cf. A033676, A033677, A140270.

Adjacent sequences: A140266 A140267 A140268 this_sequence A140270 A140271 A140272

Sequence in context: A034023 A086368 A034024 this_sequence A070003 A073539 A090779

KEYWORD

more,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), May 16 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 6 12:50 EDT 2008. Contains 144613 sequences.


AT&T Labs Research