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 #8 Mar 16 2023 05:54:13
%S 1,2,2,5,3,3,2,2,7,3,3,5,7,2,2,5,5,2,2,3,3,7,2,2,3,7,7,5,2,2,13,11,2,
%T 2,5,3,2,2,5,5,2,2,5,3,3,7,2,2,3,3,7,2,2,3,3,7,2,2,3,3,2,2,3,3,2,2,3,
%U 3,2,2,3,3,2,2,3,3,11,2,2,11,11,2,2,13,13,2,2,3,3,5,7,2,2,3,5,5
%N a(n) is the least prime factor of A361321(n) with a(1) = 1.
%H Scott R. Shannon, <a href="/A361328/b361328.txt">Table of n, a(n) for n = 1..10000</a>
%e A361321(3) = 10 = 2*5, so a(3) = 2.
%Y Cf. A361321, A000469, A361327 (greatest prime factor), A361329, A361329, A336957, A360519, A361119.
%K nonn
%O 1,2
%A _Scott R. Shannon_, _Rémy Sigrist_ and _N. J. A. Sloane_, Mar 15 2023