Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #18 Apr 21 2024 22:12:32
%S 1,2,6,4,24,18,12,120,8,96,72,48,720,54,36,600,24,480,360,240,5040,16,
%T 384,288,192,4320,216,144,3600,96,2880,2160,1440,40320,162,108,3000,
%U 72,2400,1800,1200,35280,48,1920,1440,960,30240,1080,720,25200,480,20160
%N a(n) = A346422(4*A003754(n-1) + 3) for n > 1 with a(1) = 1.
%C To get the distinct terms of A346422 in the order of their appearance up to A346422(2^n - 1), just take the first A000045(n+1) terms of this sequence and remove the duplicates.
%F a(n) = (1 + A200649(n))*a(n - A130312(n-1)) for n > 1 with a(1) = 1.
%F a(n) = A346422(4*A003754(n-1) + 3) for n > 1 with a(1) = 1.
%Y Cf. A003754, A130312, A200649, A346422.
%K nonn
%O 1,2
%A _Mikhail Kurkov_, Aug 21 2021 [verification needed]