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 A366261 #18 Mar 28 2025 03:26:13
%S A366261 1,2,4,2,4,2,6,8,16,2,6,12,6,8,4,12,24,2,6,12,6,12,6,30,24,32,4,12,36,
%T A366261 12,16,8,16,2,6,12,6,12,6,30,24,48,6,30,60,30,24,12,60,48,4,12,36,12,
%U A366261 36,12,60,72,64,8,24,72,24,32,64,2,6,12,6,12,6,30,24,48,6,30,60,30,24,12,60,120,6,30,60,30,60
%N A366261 The least number with the same prime signature as A366260, where A366260 is Doudna sequence permuted by May code.
%H A366261 Antti Karttunen, <a href="/A366261/b366261.txt">Table of n, a(n) for n = 0..16384</a>
%H A366261 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A366261 a(n) = A046523(A366260(n)).
%F A366261 a(n) = A278222(A303767(n)).
%F A366261 A001222(a(n)) = A366254(n).
%o A366261 (PARI)
%o A366261 A046523(n) = { my(f=vecsort(factor(n)[,2],,4),p);prod(i=1,#f,(p=nextprime(p+1))^f[i]) }
%o A366261 A366261(n) = A046523(A366260(n)); \\ Needs also the program given in A366260.
%Y A366261 Cf. A005940, A046523, A303767, A366260, A366262 (rgs-transform).
%Y A366261 Cf. also A278219, A278222.
%K A366261 nonn
%O A366261 0,2
%A A366261 _Antti Karttunen_, Oct 05 2023