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 A126282 #17 Jan 10 2022 10:45:22
%S A126282 3,11,43,191,797,3259,13267,54049,219277,887707
%N A126282 Median of the largest prime dividing the first 10^n numbers greater than 1.
%C A126282 A randomly selected number <= 10^n (uniform distribution from 2 to 10^n) has a 50% probability of having a prime factor at least as large as a(n).
%e A126282 The largest prime divisors of the nonunit 1-digit numbers are 2, 3, 2, 5, 3, 7, 2 and 3 respectively, with median 3.
%t A126282 f[n_Integer(* n must be even so as to find a true median, not an average, and n must be greater than *)] := Block[{cnt, lmt = n/2, p = PrimePi[n/2], q = PrimePi[n]}, cnt = q - p; p--; While[cnt < lmt, cnt = cnt + Floor[n/Prime@ p]; p-- ]; p++; Prime@ p]; MapAt[# + 1 &, Reap[Do[Sow@ f[10^n], {n, 6}]][[-1, -1]], 1]
%Y A126282 Cf. A124202, A126283, A281889, A284411.
%K A126282 nonn,more
%O A126282 1,1
%A A126282 Mark Thornquist (mthornqu(AT)fhcrc.org) and _Robert G. Wilson v_, Dec 15 2006