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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A069810 Integers k such that gcd(k, sigma(k)) = tau(k). 5
 1, 56, 60, 96, 132, 184, 204, 248, 276, 348, 376, 480, 492, 504, 564, 568, 612, 632, 636, 708, 824, 852, 996, 1016, 1068, 1208, 1212, 1248, 1284, 1336, 1356, 1528, 1572, 1592, 1632, 1644, 1784, 1788, 1908, 1912, 1980, 2004, 2076, 2104, 2148, 2168, 2232 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Giovanni Resta, Table of n, a(n) for n = 1..10000 EXAMPLE The divisors of 56 are 1, 2, 4, 7, 8, 14, 28, 56, so tau(56) = 8 and sigma(56) = 120. As gcd(56, 120) = tau(56) = 8, so 56 belongs to this sequence. - Bernard Schott, Oct 18 2019 MATHEMATICA Select[Range[2500], GCD[DivisorSigma[1, #], #] == DivisorSigma[0, #] &] (* Jayanta Basu, Mar 21 2013 *) PROG (PARI) for(n=1, 3000, if(gcd(n, sigma(n))==numdiv(n), print1(n, ", "))) (Magma) [k:k in [1..2300]| Gcd(k, DivisorSigma(1, k)) eq #Divisors(k)]; // Marius A. Burtea, Oct 18 2019 CROSSREFS Subsequence of A047727 (numbers that are arithmetic and refactorable). Cf. A003601 (arithmetic numbers), A033950 (refactorable numbers). Sequence in context: A045001 A116660 A047727 * A292896 A154768 A165159 Adjacent sequences: A069807 A069808 A069809 * A069811 A069812 A069813 KEYWORD easy,nonn AUTHOR Benoit Cloitre, Apr 30 2002 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.

Last modified March 1 22:23 EST 2024. Contains 370443 sequences. (Running on oeis4.)