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 A362050 #6 Apr 20 2023 14:56:08 %S A362050 4,54,81,90,100,126,135,140,189,198,220,234,260,297,306,340,342,351, %T A362050 380,414,459,460,513,522,558,580,620,621,666,738,740,774,783,820,837, %U A362050 846,860,940,954,999,1060,1062,1098,1107,1161,1180,1206,1220,1269,1278,1314 %N A362050 Numbers whose prime indices satisfy: (length) = 2*(median). %C A362050 A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. %C A362050 The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length). %C A362050 All terms are squarefree. %e A362050 The terms together with their prime indices begin: %e A362050 4: {1,1} %e A362050 54: {1,2,2,2} %e A362050 81: {2,2,2,2} %e A362050 90: {1,2,2,3} %e A362050 100: {1,1,3,3} %e A362050 126: {1,2,2,4} %e A362050 135: {2,2,2,3} %e A362050 140: {1,1,3,4} %e A362050 189: {2,2,2,4} %e A362050 198: {1,2,2,5} %t A362050 prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]; %t A362050 Select[Range[100],PrimeOmega[#]==2*Median[prix[#]]&] %Y A362050 The LHS is A001222 (bigomega). %Y A362050 The RHS is A360005 (twice median). %Y A362050 Before multiplying the median by 2, A361800 counts partitions of this type. %Y A362050 For maximum instead of length we have A361856, counted by A361849. %Y A362050 Partitions of this type are counted by A362049. %Y A362050 A061395 gives greatest prime index, least A055396. %Y A362050 A112798 lists prime indices, sum A056239. %Y A362050 A326567/A326568 gives mean of prime indices. %Y A362050 Cf. A067801, A106529, A111907, A255201, A316413, A361868, A361908. %K A362050 nonn %O A362050 1,1 %A A362050 _Gus Wiseman_, Apr 20 2023