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!)
A187711 Integers n which equal (product of divisors of n) mod (sum of divisors of n). 2
2, 3, 5, 7, 10, 11, 13, 17, 19, 20, 23, 29, 31, 33, 37, 40, 41, 43, 47, 53, 59, 61, 67, 71, 73, 76, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 136, 137, 139, 145, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 207, 211, 223, 227, 229, 233, 239, 241, 251, 257, 261, 263, 269, 271, 277 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
{n: n = A187680(n)}
MAPLE
isA187711 := proc(n) is(A187680(n) = n) end proc:
for n from 2 to 300 do if isA187711(n) then printf("%d, ", n) ; end if; end do: # R. J. Mathar, Mar 17 2011
MATHEMATICA
Select[Range[300], Mod[#^(DivisorSigma[0, #]/2), DivisorSigma[1, #]] == # &] (* G. C. Greubel, Nov 05 2018 *)
CROSSREFS
Sequence in context: A048461 A338174 A058590 * A064627 A324813 A235050
KEYWORD
nonn
AUTHOR
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 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)