%I #7 May 08 2015 16:57:00
%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,2,1,0,0,8,0,0,0,1,0,2,0,0,6,5,0,0,2,0,
%T 3,0,0,4,2,0,0,1,0,1,0,0,2,3,0,6,0,3,3,0,0,0,1,4,1,3,0,5,0,0,4,4,0,2,
%U 6,3,0,0,0,3,1,3,4,0,3,8,0,0,2,6,0,7
%N Smallest k, such that n is a Belgian-k number.
%C See A106039 for definition of Belgian-k numbers;
%C a(n) = A257770(n,0);
%C a(n) <= A257779(n); a(A257785(n)) = A257779(A257785(n));
%C conjecture: a(n) < 9;
%C a(A106039(n)) = 0; a(A257782(n)) > 0.
%H Reinhard Zumkeller, <a href="/A257778/b257778.txt">Table of n, a(n) for n = 0..10000</a>
%o (Haskell)
%o a257778 = head . a257770_row
%Y Cf. A106039, A257770, A257773, A257779, A257782.
%K nonn
%O 0,15
%A _Reinhard Zumkeller_, May 08 2015