|
Search: id:A112640
|
|
|
| A112640 |
|
Odd abundant numbers divisible neither by 5 nor by 7. |
|
+0
5
|
|
| 28683369, 36165987, 38660193, 86050107, 108497961, 115980579, 131339637, 138428433, 140397543, 153393669, 160876287, 258150321, 277272567, 296394813, 315517059, 325493883, 347941737, 353761551, 372883797, 373715199, 392006043
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
C. Rivera, Puzzle 329. Odd abundant numbers not divided by 2 or 3.
|
|
MATHEMATICA
|
ta={{0}}; Do[g=n; s=DivisorSigma[1, n]-2*n; If[Greater[s, 0]&&!Equal[Mod[n, 2], 0]&&!Equal[Mod[n, 5], 0]&&!Equal[Mod[n, 7], 0], Print[n]; ta=Append[ta, n]], {n, 1, 100000000}]; ta=Delete[ta, 1]
|
|
CROSSREFS
|
Cf. A110585, A064001.
Adjacent sequences: A112637 A112638 A112639 this_sequence A112641 A112642 A112643
Sequence in context: A018187 A114681 A101639 this_sequence A104828 A105013 A107619
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Sep 15 2005
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 19 2005
|
|
|
Search completed in 0.002 seconds
|
