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 A343252 #34 Jul 13 2022 02:06:45
%S A343252 1,2,3,4,5,3,1,8,9,5,11,4,13,2,5,16,17,9,19,5,3,11,23,8,25,13,27,4,29,
%T A343252 5,31,32,11,17,5,9,37,19,13,8,41,3,43,11,9,23,47,16,1,25,17,13,53,27,
%U A343252 11,8,19,29,59,5,61,31,9,64,13,11,67,17,23,5,71,9,73,37,25,19,11,13,79,16
%N A343252 a(n) is the least k0 <= n such that v_7(n), the 7-adic order of n, can be obtained by the formula: v_7(n) = log_7(n / L_7(k0, n)), where L_7(k0, n) is the lowest common denominator of the elements of the set S_7(k0, n) = {(1/n)*binomial(n, k), with 0 < k <= k0 such that k is not divisible by 7} or 0 if no such k0 exists.
%C A343252 Conjecture: a(n) is the greatest power of a prime different from 7 that divides n.
%H A343252 Dario T. de Castro, <a href="http://math.colgate.edu/~integers/w61/w61.pdf">P-adic Order of Positive Integers via Binomial Coefficients</a>, INTEGERS, Electronic J. of Combinatorial Number Theory, Vol. 22, Paper A61, 2022.
%e A343252 For n = 10, a(10) = 5. To understand this result, consider the largest set S_7, which is the S_7(k0=10, 10). According to the definition, S_7(n, n) is the set of elements of the form (1/n)*binomial(n, k), where k goes from 1 to n, skipping the multiples of 7. The elements of S_7(10, 10) are {1, 9/2, 12, 21, 126/5, 21, 0, 9/2, 1, 1/10}, where the zero was inserted pedagogically to identify the skipped term, i.e., when k is divisible by 7. At this point we verify which of the nested subsets {1}, {1, 9/2}, {1, 9/2, 12}, {1, 9/2, 12, 21}, ... will match for the first time the p-adic order's formula. If k varies from 1 to 5 (instead of 10) we see that the lowest common denominator of the set S_7(5, 10) will be 10. So, L_7(5, 10) = 10 and the equation v_7(10) = log_7(10/10) yields a True result. Then we may say that a(10) = 5 specifically because 5 was the least k0.
%t A343252 j = 4;
%t A343252 Nmax = 250;
%t A343252 Array[val, Nmax];
%t A343252 Do[val[i] = 0, {i, 1, Nmax}];
%t A343252 Do[flag = 0;
%t A343252 Do[If[(flag == 0 &&
%t A343252 Prime[j]^IntegerExponent[n, Prime[j]] ==
%t A343252 n/LCM[Table[
%t A343252 If[Divisible[k, Prime[j]], 1,
%t A343252 Denominator[(1/n) Binomial[n, k]]], {k, 1, k}] /.
%t A343252 List -> Sequence]), val[n] = k; flag = 1; , Continue], {k, 1,
%t A343252 n, 1}], {n, 1, Nmax}];
%t A343252 tabseq = Table[val[i], {i, 1, Nmax}];
%t A343252 (* alternate code *)
%t A343252 a[n_] := Module[{k = 1, v = IntegerExponent[n, 7]}, While[Log[7, n/LCM @@ Denominator[Binomial[n, Select[Range[k], ! Divisible[#, 7] &]]/n]] != v, k++]; k]; Array[a, 100] (* _Amiram Eldar_, Apr 23 2021 *)
%o A343252 (PARI) Lp(k, n, p) = {my(list = List()); for (i=1, k, if (i%p, listput(list, binomial(n, i)/n)); ); lcm(apply(denominator, Vec(list))); }
%o A343252 isok(k, n, v, p) = p^v == n/Lp(k, n, p);
%o A343252 a(n, p=7) = {my(k=1, v=valuation(n, p)); for (k=1, n, if (isok(k, n, v, p), return(k)); ); n; } \\ _Michel Marcus_, Apr 22 2021
%Y A343252 Cf. A214411, A343249, A343250, A343251, A343253.
%K A343252 nonn
%O A343252 1,2
%A A343252 _Dario T. de Castro_, May 31 2021