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 A364550 #5 Jul 29 2023 14:35:50
%S A364550 1,2,3,4,5,6,8,10,12,16,20,24,32,40,48,64,80,96,128,160,192,256,320,
%T A364550 384,512,640,768,1024,1280,1536,2048,2560,3072,3125,4096,5120,6144,
%U A364550 6250,7875,8192,10240,12005,12288,12500,13365,15750,16384,20480,22869,23595,24010,24576,25000,26730,31500,32768,40960,45738,46475
%N A364550 Numbers k such that k is a multiple of A005941(k).
%C A364550 Numbers k such that k is a multiple of 1+A156552(k).
%C A364550 If k is a term, then also 2*k is present in this sequence, and vice versa.
%o A364550 (PARI) A005941(n) = { my(f=factor(n), p, p2=1, res=0); for(i=1, #f~, p = 1 << (primepi(f[i, 1])-1); res += (p * p2 * (2^(f[i, 2])-1)); p2 <<= f[i, 2]); (1+res) }; \\ (After _David A. Corneth_'s program for A156552) - _Antti Karttunen_, Jul 28 2023
%o A364550 isA364550(n) = !(n%A005941(n));
%Y A364550 Cf. A005941, A156552, A364548.
%Y A364550 Subsequence of A364560.
%Y A364550 Subsequences: A029747, A364551 (odd terms).
%Y A364550 Cf. also
%K A364550 nonn
%O A364550 1,2
%A A364550 _Antti Karttunen_, Jul 28 2023