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 A351548 #36 Dec 05 2024 11:38:33
%S A351548 0,60,108,336,1232,11088,114240,261888,320320,418880,2790720,2882880,
%T A351548 3769920,6499584,9801792,16930368,19171152,35672000,47736000,51068160,
%U A351548 98654400,110046720,172540368,229909120,403504640,487788480,738152448,755415680,886792320,1960686000,2070484416,2339064000,2889432000
%N A351548 a(n) = A349745(n) divided by 2 if it is even, and 0 if A349745(n) is odd.
%C A351548 Questions: Are all nonzero terms abundant (in A005101)? Are all terms even? Could either be proved? See also comments in A351538 and in A351549.
%C A351548 The terms a(2) .. a(52) are all also practical (A005153) and Zumkeller (A083207). - _Antti Karttunen_, Dec 05 2024
%H A351548 Antti Karttunen, <a href="/A351548/b351548.txt">Table of n, a(n) for n = 1..52</a> (prepared from the b-file of A349745 computed by _Amiram Eldar_)
%H A351548 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A351548 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A351548 a(n) = 0 if A349745(n) is odd, a(n) = A349745(n)/2 otherwise.
%o A351548 (PARI) A351548(n) = { my(u=A349745(n)); if(u%2,0,u/2); };
%Y A351548 Cf. A005101, A005153, A083207, A326051 (all six known terms are present here), A329963, A349169, A349745, A351458, A351459, A351538.
%Y A351548 Cf. also A351549.
%K A351548 nonn
%O A351548 1,2
%A A351548 _Antti Karttunen_, Feb 18 2022