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!)
A234367 Numbers such that gcd(sigma(n), n) != 1 and still have numerator(sigma(n)/n) > n. 2
20, 70, 80, 104, 160, 208, 272, 320, 350, 416, 464, 490, 544, 550, 650, 770, 832, 928, 1088, 1184, 1190, 1280, 1300, 1312, 1332, 1430, 1610, 1664, 1696, 1700, 1750, 1856, 1870, 1952, 2170, 2196, 2210, 2368, 2420, 2530, 2560, 2590, 2624, 2628, 2750, 2990, 3010 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
For numbers in A014567, we have A017665(n) = numerator(sigma(n)/n) = sigma(n) = A000203(n), so A017665(n) > n.
For numbers in A069059, since both terms of the fraction are divided by their GCD, A009194(n), we will have A017665(n) < A000203(n).
Here we are interested in terms of A069059 for which we still have A017665(n) > n, despite the division by the GCD.
Numbers such that sigma(n)/n > gcd(sigma(n), n) > 1. - Charlie Neder, Sep 08 2018
LINKS
Charlie Neder, Table of n, a(n) for n = 1..6892 (Terms < 10^6)
EXAMPLE
For n=20, we have A000203(20) = sigma(20) = 42, and since gcd(42, 20) != 1, then A017665(20) = numerator(42/20) = numerator(21/10) = 21 < sigma(20), but still A017665(20) > 20.
MATHEMATICA
gnQ[n_]:=Module[{s=DivisorSigma[1, n]}, GCD[s, n]!=1&&Numerator[s/n]>n]; Select[ Range[ 3100], gnQ] (* Harvey P. Dale, Jan 03 2018 *)
PROG
(PARI) isok(n) = (gcd(sigma(n), n) != 1) && (numerator(sigma(n)/n) > n);
CROSSREFS
Sequence in context: A363840 A238101 A153728 * A071395 A362053 A357921
KEYWORD
nonn,nice
AUTHOR
Michel Marcus, Dec 28 2013
STATUS
approved

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 April 21 00:22 EDT 2024. Contains 371850 sequences. (Running on oeis4.)