|
%I #21 Sep 09 2017 19:34:11
%S 0,1,2,3,4,6,8,9,10,12,15,16,20,24,25,28,30,35,36,42,48,49,54,56,63,
%T 64,72,80,81,88,90,99,100,110,120,121,130,132
%N Numbers in whose minimally runlength-encoded unordered partition all parts are equal; positions of zeros in A227761.
%C After 3 no more primes. First missing composites are: 14, 18, 21, 22, 26, 27, 32, 33, 34, 38, 39, 40, ...
%e The first row in A227739 (please see its Example section) that sums to 6 occurs as its row 8 (= A227368(6)). The corresponding partition {3+3} contains only equal parts, thus 6 is a member of this sequence. The first row in A227739 that sums to 5 occurs as its row 9 (= A227368(5)). The corresponding partition {1+2+2} contains more than just one kind of summands, thus 5 do not occur in this sequence.
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A227762 (ZERO-POS 1 0 A227761))
%Y Cf. A227761, A227739, A227368.
%K nonn,more
%O 1,3
%A _Antti Karttunen_, Jul 26 2013
|
