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 A361662 #15 Jul 15 2023 14:55:37
%S A361662 1,4,6,8,24,48,96,12,216,24,60,48,30,96,210,32,288,216,72,24,216,60,
%T A361662 240,48,210,36,6480,96,15552,4320,7560,64,120,288,2520,216,5040,72,
%U A361662 960,768,2520,216,576,60,83160,240,7680,48,18480,13860,7776,144,1152,6480
%N A361662 Least number k >= 1 such that A074206(k) is divisible by n.
%C A361662 a(n) exists for all n. (This is problem 5 of the first round of the British Mathematical Olympiad 2022/2023.)
%C A361662 All terms are in A025487.
%H A361662 Pontus von Brömssen, <a href="/A361662/b361662.txt">Table of n, a(n) for n = 1..10000</a>
%H A361662 British Mathematical Olympiad, <a href="https://bmos.ukmt.org.uk/home/bmo1-2023.pdf">Round 1</a>, Problem 5, 2022/2023.
%H A361662 <a href="/index/O#Olympiads">Index to sequences related to Olympiads</a>.
%F A361662 a(n) = A025487(A361663(n)).
%o A361662 (PARI) f(n)={if(!n, 0, my(sig=factor(n)[, 2], m=vecsum(sig)); sum(k=0, m, prod(i=1, #sig, binomial(sig[i]+k-1, k-1))*sum(r=k, m, binomial(r, k)*(-1)^(r-k))))}; \\ A074206
%o A361662 a(n) = my(k=1); while (f(k) % n, k++); k; \\ _Michel Marcus_, Mar 23 2023
%Y A361662 Cf. A025487, A074206, A361663, A361664, A361666.
%K A361662 nonn
%O A361662 1,2
%A A361662 _Pontus von Brömssen_, Mar 20 2023