cp's OEIS Frontend

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.

A321699 MM-numbers of uniform regular multiset multisystems spanning an initial interval of positive integers.

This page as a plain text file.
%I A321699 #18 Dec 28 2018 13:59:39
%S A321699 1,2,3,4,7,8,9,13,15,16,19,27,32,49,53,64,81,113,128,131,151,161,165,
%T A321699 169,225,243,256,311,343,361,512,719,729,1024,1291,1321,1619,1937,
%U A321699 1957,2021,2048,2093,2117,2187,2197,2257,2401,2805,2809,3375,3671,4096,6561
%N A321699 MM-numbers of uniform regular multiset multisystems spanning an initial interval of positive integers.
%C A321699 A multiset multisystem is a finite multiset of finite multisets. 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. The multiset multisystem with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset multisystem with MM-number 78 is {{},{1},{1,2}}.
%C A321699 A multiset multisystem is uniform if all parts have the same size, and regular if all vertices appear the same number of times. For example, {{1,1},{2,3},{2,3}} is uniform, regular, and spans an initial interval of positive integers, so its MM-number 15463 belongs to the sequence.
%e A321699 The sequence of all uniform regular multiset multisystems spanning an initial interval of positive integers, together with their MM-numbers, begins:
%e A321699     1: {}
%e A321699     2: {{}}
%e A321699     3: {{1}}
%e A321699     4: {{},{}}
%e A321699     7: {{1,1}}
%e A321699     8: {{},{},{}}
%e A321699     9: {{1},{1}}
%e A321699    13: {{1,2}}
%e A321699    15: {{1},{2}}
%e A321699    16: {{},{},{},{}}
%e A321699    19: {{1,1,1}}
%e A321699    27: {{1},{1},{1}}
%e A321699    32: {{},{},{},{},{}}
%e A321699    49: {{1,1},{1,1}}
%e A321699    53: {{1,1,1,1}}
%e A321699    64: {{},{},{},{},{},{}}
%e A321699    81: {{1},{1},{1},{1}}
%e A321699   113: {{1,2,3}}
%e A321699   128: {{},{},{},{},{},{},{}}
%e A321699   131: {{1,1,1,1,1}}
%e A321699   151: {{1,1,2,2}}
%e A321699   161: {{1,1},{2,2}}
%e A321699   165: {{1},{2},{3}}
%e A321699   169: {{1,2},{1,2}}
%e A321699   225: {{1},{1},{2},{2}}
%e A321699   243: {{1},{1},{1},{1},{1}}
%e A321699   256: {{},{},{},{},{},{},{},{}}
%e A321699   311: {{1,1,1,1,1,1}}
%e A321699   343: {{1,1},{1,1},{1,1}}
%e A321699   361: {{1,1,1},{1,1,1}}
%e A321699   512: {{},{},{},{},{},{},{},{},{}}
%e A321699   719: {{1,1,1,1,1,1,1}}
%e A321699   729: {{1},{1},{1},{1},{1},{1}}
%t A321699 primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
%t A321699 normQ[sys_]:=Or[Length[sys]==0,Union@@sys==Range[Max@@Max@@sys]];
%t A321699 Select[Range[1000],And[normQ[primeMS/@primeMS[#]],SameQ@@PrimeOmega/@primeMS[#],SameQ@@Last/@FactorInteger[Times@@primeMS[#]]]&]
%Y A321699 Cf. A005176, A007016, A112798, A302242, A306021, A319056, A319189, A320324, A321698, A321717, A322554, A322703, A322833.
%K A321699 nonn
%O A321699 1,2
%A A321699 _Gus Wiseman_, Dec 27 2018