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 A072212 #4 Aug 14 2024 18:14:01
%S A072212 6,13,22,33,46,61,77,95,115,136,160,185,211,240,270,302,335,370,407,
%T A072212 445,486,527,571,616,663,711,761,813,867,922,978,1037,1097,1159,1222,
%U A072212 1287,1354,1422,1492,1563,1637,1711,1788,1866,1946,2027,2110,2195,2281
%N A072212 Smallest m such that number of partitions of m exceeds 10^n.
%t A072212 f[n_] := Block[{m = 1}, While[ PartitionsP[m] < 10^n, m++ ]; m]; Table[ f[n], {n, 0, 50}]
%t A072212 With[{tbl=Table[{m,PartitionsP[m]},{m,2500}]},Table[SelectFirst[tbl,#[[2]]>10^n&],{n,50}]][[;;,1]] (* _Harvey P. Dale_, Aug 14 2024 *)
%Y A072212 Cf. A000041.
%K A072212 nonn
%O A072212 1,1
%A A072212 _Jeff Burch_, Jul 03 2002