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 A376545 #18 Oct 23 2024 01:26:43 %S A376545 1,2,3,2,3,2,127,2,3,1234567891,2,9091,3,12345678910111,2,17,113,7,2, %T A376545 19,3,7,2,123456789101112131415161,3,13,2,17,13,2,2,2,3,2,2,2,3,2,2,2, %U A376545 5,2,2,2,3,2,2,2,3,3,2,3,29,547,2,3,3,3,2,31,3,3,2,3,71,7 %N A376545 Least prime factor of A252043(n) for n > 1 with a(1) = 1. %H A376545 Micha Fleuren, <a href="https://archive.org/details/reverse-factors">Smarandache Factors and Reverse Factors</a>. %F A376545 a(n) = A020639(A252043(n)). %e A376545 A252043(3) = 123 = 3 * 41, so a(3) = 3. %o A376545 (PARI) a(n) = my(list=List(), k=1); while(#list<n, my(d=digits(k)); for (i=1, #d, listput(list, d[i])); k++;); my(m=fromdigits(Vec(list, n))); if (m==1, 1, vecmin(factor(m)[,1])); \\ _Michel Marcus_, Sep 29 2024 %Y A376545 Cf. A020639, A252043, A376274. %K A376545 nonn,base %O A376545 1,2 %A A376545 _Jean-Marc Rebert_, Sep 27 2024