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 A364546 #9 Jul 28 2023 16:05:42 %S A364546 1,2,3,4,5,6,8,10,12,16,20,24,32,40,48,64,80,96,128,160,192,256,320, %T A364546 384,512,640,768,1024,1035,1280,1536,2048,2070,2560,3072,4096,4140, %U A364546 5120,6144,8192,8280,10240,12288,16384,16560,20480,24576,32768,33120,40960,49152,65536,66240,81920,98304,131072,132480,163840 %N A364546 Numbers k such that k is a multiple of A005940(k). %C A364546 Sequence A005941(A364548(.)) sorted into ascending order. %C A364546 If k is a term, then also 2*k is present in this sequence, and vice versa. %C A364546 A029747 is included as a subsequence, because it gives the known fixed points of map n -> A005940(n). %t A364546 nn = 2^18; Array[Set[a[#], #] &, 2]; Do[If[EvenQ[n], Set[a[n], 2 a[n/2]], Set[a[n], Times @@ Power @@@ Map[{Prime[PrimePi[#1] + 1], #2} & @@ # &, FactorInteger[a[(n + 1)/2]]]]], {n, 3, nn}]; Select[Range[nn], Divisible[#, a[#]] &] (* _Michael De Vlieger_, Jul 28 2023 *) %o A364546 (PARI) %o A364546 A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; %o A364546 isA364546(n) = !(n%A005940(n)); %Y A364546 Positions of 1's in A364502. %Y A364546 Subsequence of A364541. %Y A364546 Subsequences: A029747, A364547 (odd terms). %Y A364546 Cf. A005940, A364544, A364548. %Y A364546 Cf. also A364496. %K A364546 nonn %O A364546 1,2 %A A364546 _Antti Karttunen_, Jul 28 2023