%I
%S 0,0,0,0,0,1,0,2,0,0,0,1,0,2,1,0,0,1,1,1,0,1,1,2,0,0,1,1,0,1,0,1,1,2,
%T 1,0,0,1,1,1,1,1,0,1,1,1,1,2,0,0,1,1,1,1,0,1,0,1,1,1,1,2,1,0,0,1,1,1,
%U 1,1,1,1,0,1,1,1,1,1,1,2,0,0,1,1,1,1,1
%N a(n) is the maximal difference between successive parts in the minimally runlengthencoded unordered partition of n (A227368(n)).
%C After n=3, only composites may obtain value 0. (But not all of them do; see A227762.) The first nine n for which a(n)=2 are 7, 13, 23, 33, 47, 61, 79, 97, 119, of which all are primes except 33 and 119. Conjecture: these values are given by A227786.
%C Are there any terms larger than 2?
%H Antti Karttunen, <a href="/A227761/b227761.txt">Table of n, a(n) for n = 0..132</a>
%F a(0) = a(1) = 0, and for n>1, a(n) = A043276(A163575(A227368(n)))  1.
%o (Scheme)
%o (define (A227761 n) (if (< n 2) 0 ( (A043276 (A163575 (A227368 n))) 1)))
%o ;; Alternative version which uses auxiliary functions DIFF and binexp_to_ascpart which can be found in the Program section of A129594:
%o (define (A227761v2 n) (if (< n 2) 0 (apply max (DIFF (binexp_to_ascpart (A227368 n))))))
%Y A227762 gives the positions of zeros, in other words, such n that their minimally runlengthencoded partition consists of identical parts.
%Y Cf. also A227368 (for the concept of minimally runlengthencoded unordered partition).
%K nonn
%O 0,8
%A _Antti Karttunen_, Jul 26 2013
