|
%I #5 Feb 14 2015 21:29:38
%S 0,1,2,2,3,3,3,4,4,4,4,4,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,
%T 6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,8,8,
%U 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,9
%N After zero, each n occurs A255071(n) times.
%C An auxiliary sequence for computing A255122 and A255056.
%H Antti Karttunen, <a href="/A255121/b255121.txt">Table of n, a(n) for n = 0..721</a>
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A255121 (COMPOSE -1+ (LEAST-GTE-I 0 1 A255061)))
%Y Cf. A255056, A255061, A255071, A255122.
%Y Similar sequence: A213711.
%K nonn
%O 0,3
%A _Antti Karttunen_, Feb 14 2015
|
