cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A192853 Places n such that the two remainders A187680(n) and A191906(n) are both zero.

This page as a plain text file.
%I A192853 #23 Apr 22 2025 10:00:54
%S A192853 6,28,120,270,496,672,924,1320,3948,7980,8128,10920,12690,15456,18018,
%T A192853 25296,27930,29190,30240,30294,32760,35640,52080,55692,61770,69936,
%U A192853 76986,83160,83580,86814,106950,127218,130200,131040,141360,155610
%N A192853 Places n such that the two remainders A187680(n) and A191906(n) are both zero.
%C A192853 The even perfect numbers (A000396) are a subsequence.
%H A192853 Robert Israel, <a href="/A192853/b192853.txt">Table of n, a(n) for n = 1..214</a>
%p A192853 filter:= proc(n) local Q,p,s;
%p A192853   Q:= numtheory:-divisors(n) minus {n};
%p A192853   p:= convert(Q,`*`); s:= convert(Q,`+`);
%p A192853   p mod s = 0 and (p * n ) mod (s + n ) = 0
%p A192853 end proc:
%p A192853 select(filter, [$2..2*10^5]); # _Robert Israel_, Apr 22 2025
%Y A192853 Cf. A000396, A145551, A187680, A191906
%K A192853 nonn
%O A192853 1,1
%A A192853 _Juri-Stepan Gerasimov_, Jul 11 2011