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.
%I A336641 #18 Dec 10 2023 17:36:03
%S A336641 6,24,28,96,120,150,294,384,496,1014,1536,3276,3750,3780,6144,8128,
%T A336641 14406,20328,24576,32760,93750,98304,171366,306180,393216,705894,
%U A336641 1241460,1572864,2343750,6291456,16380000,24800580,25165824,28960854,30387840,33550336,34588806,58593750,100663296,165143160,332226048,402653184
%N A336641 Numbers k such that A007913(k) divides sigma(k) and A008833(k)-1 either divides A326127(k) (= sigma(k)-core(k)-k), or both are zero.
%C A336641 Numbers k such that A326128(k) = A326129(k) form a subsequence of this sequence. So far it is not known whether it contains any other terms apart from those of A000396. See comments in A326129.
%C A336641 Sequence is infinite because all numbers of the form 6*4^n (A002023) are present.
%C A336641 Question: Are there any odd terms?
%H A336641 <a href="/index/O#opnseqs">Index entries for sequences where odd perfect numbers must occur, if they exist at all</a>
%o A336641 (PARI) isA336641(n) = { my(c=core(n), s=sigma(n), u=((n/c)-1)); (!(s%c) && (gcd(u,(s-c-n))==u)); };
%Y A336641 Cf. A000203, A007913, A228058, A326126, A326127, A326128, A326129, A336642.
%Y A336641 Cf. A000396, A002023 (subsequences).
%Y A336641 Cf. also A336550 for a similar construction.
%K A336641 nonn
%O A336641 1,1
%A A336641 _Antti Karttunen_, Jul 28 2020