Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 May 13 2013 01:49:39
%S 1,4,7,13,19,31,37,43,61,67,73,79,97,103,109,127,139,151,157,163,181,
%T 193,199,211,223,229,241,271,277,283,307,313,331,337,349,367,373,379,
%U 397,409,421,433,439,448,457,463,487,499,523,541
%N Numbers n such that (product of divisors of 2n) mod (sum of divisors of 2n) is equal to number of divisors of 2n.
%o (PARI) is(n)=my(t=2*n,P=if(issquare(t,&t), t^numdiv(t^2),t^(numdiv(t)/2))); P%sigma(2*n)==numdiv(2*n) \\ _Charles R Greathouse IV_, Jun 19 2011
%Y Cf. A000005, A000203, A007955, A016777, A187680.
%K nonn,less
%O 1,2
%A _Juri-Stepan Gerasimov_, Jun 18 2011
%E More terms from _Charles R Greathouse IV_, Jun 19 2011