This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A238896 Number of times that the number A238895(n) occurs in the sum of proper divisors function (A001065). 3
 0, 1, 2, 3, 5, 6, 8, 9, 10, 13, 15, 20, 21, 24, 25, 27, 32, 34, 41, 44, 46, 56, 59, 70, 74, 76, 86, 92, 99, 115, 116, 129, 138, 145, 156, 164, 169, 171, 193, 199, 222, 223, 242, 246, 268, 270, 278, 295, 304, 334, 343, 365, 397, 398, 433, 452, 471, 482, 521 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS MATHEMATICA nn = 1000; s = Table[0, {nn}]; Do[k = DivisorSigma[1, n] - n; If[0 < k <= nn, s[[k]]++], {n, nn^2}]; mx = -1; t = {}; Do[If[s[[n]] > mx, mx = s[[n]]; AppendTo[t, {n, mx}]], {n, 2, nn}]; Transpose[t][[2]] CROSSREFS Cf. A001065, A005114, A048138, A238895. Sequence in context: A087067 A166018 A225745 * A190842 A273106 A191179 Adjacent sequences:  A238893 A238894 A238895 * A238897 A238898 A238899 KEYWORD nonn AUTHOR T. D. Noe, Mar 10 2014 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.

Last modified January 17 14:12 EST 2019. Contains 319225 sequences. (Running on oeis4.)