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 A225637 #19 Mar 05 2025 13:44:15 %S A225637 1,1,2,2,3,2,2,5,7,2,3,2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,2,2,3,3,2,3,2, %T A225637 2,2,3,3,2,2,3,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,6,6,2,2,2,2, %U A225637 4,4,4,4,2,2,2,2,2,2,4,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2 %N A225637 a(n) = A003418(n)/A225629(n). %C A225637 For n >= 2, a(n) is the final factor by which the A225629(n) needs to be multiplied that it finally reaches the fixed point A003418(n) of the column n of A225630. %C A225637 The first composite, 4, occurs at n=20. The first composite which is not power of prime, namely 6, occurs at n=61. %C A225637 For all n >= 3, a(n) divides A225558(n). %o A225637 (Scheme) (define (A225637 n) (/ (A003418 n) (A225629 n))) %Y A225637 Cf. A003418, A225629, A225636, A225558, A225652, A225656. %K A225637 nonn %O A225637 0,3 %A A225637 _Antti Karttunen_, May 13 2013