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 A302597 #4 Apr 10 2018 21:50:12 %S A302597 1,2,3,5,6,7,10,11,14,17,19,21,22,23,31,34,38,41,42,46,53,57,59,62,67, %T A302597 82,83,97,103,106,109,114,115,118,127,131,133,134,157,159,166,179,191, %U A302597 194,206,211,218,227,230,241,254,262,266,277,283,311,314,318,331 %N A302597 Squarefree numbers whose prime indices are powers of a common prime number. %C A302597 A prime index of n is a number m such that prime(m) divides n. %e A302597 Entry A302242 describes a correspondence between positive integers and multiset multisystems. In this case it gives the following sequence of set systems. %e A302597 01: {} %e A302597 02: {{}} %e A302597 03: {{1}} %e A302597 05: {{2}} %e A302597 06: {{},{1}} %e A302597 07: {{1,1}} %e A302597 10: {{},{2}} %e A302597 11: {{3}} %e A302597 14: {{},{1,1}} %e A302597 17: {{4}} %e A302597 19: {{1,1,1}} %e A302597 21: {{1},{1,1}} %e A302597 22: {{},{3}} %e A302597 23: {{2,2}} %e A302597 31: {{5}} %e A302597 34: {{},{4}} %e A302597 38: {{},{1,1,1}} %t A302597 primeMS[n_]:=If[n===1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]; %t A302597 Select[Range[100],SameQ@@Join@@primeMS/@primeMS[#]&&SquareFreeQ[#]&] %Y A302597 Cf. A000961, A001222, A003963, A005117, A007716, A056239, A275024, A047966, A281113, A296134, A301766, A302242, A302243. %K A302597 nonn %O A302597 1,2 %A A302597 _Gus Wiseman_, Apr 10 2018