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 A374959 #13 Jul 30 2024 10:06:24
%S A374959 0,1,1,1,1,2,1,1,1,2,1,2,1,2,2,1,1,2,1,3,2,4,1,3,1,2,1,2,1,3,1,1,3,2,
%T A374959 3,2,1,4,2,3,1,3,1,3,2,8,1,5,1,2,2,6,1,4,2,3,2,2,1,3,1,2,4,1,4,4,1,2,
%U A374959 6,4,1,5,1,2,2,4,5,2,1,3,1,2,1,3,3,4,3
%N A374959 a(n) is the least k such that binomial(A349958(n), k) is a multiple of n.
%e A374959 For n = 12: the first multiple of 12 in Pascal's triangle appears in row 9; this row contains: 1, 9, 36, 84, 126, 126, 84, 36, 9, 1; the first multiple of 12 (36), appears at (0-based) index 2; so a(12) = 2.
%o A374959 (PARI) a(n) = { my (r = [1 % n], j); for (i = 0, oo, if (vecmin(r, &j)==0, return (j-1), r = (concat(0, r) + concat(r, 0)) % n;);); }
%o A374959 (Python)
%o A374959 from math import comb
%o A374959 def A374959(n): return next(k for j in range(n+1) for k in range(j+1) if not (comb(j,k) % n)) # _Chai Wah Wu_, Jul 30 2024
%Y A374959 Cf. A007318, A349958, A357327.
%K A374959 nonn
%O A374959 1,6
%A A374959 _Rémy Sigrist_, Jul 25 2024