%I
%S 1,0,0,1,3,0,3,2,0,3,3,1,8,0,5,0,2,9,0,3,9,3,2,6,0,6,2,4,0,4,2,4,2,2,
%T 1,23,0,8,25,0,3,19,0,3,3,1,11,0,5,34,0,3,7,0,3,3,1,11,11,1,3,5,13,0,
%U 10,0,2,33,0,3,9,50,0,4,42,0,3,7,25,40,0,5,20,0,3,8,48,0,4,15
%N Van Eck's sequence (cf. A181391), but starting with a(1) = 1.
%C After the initial value, the sequence is extended by a(n+1) = min { k > 0: a(nk) = a(n) } or 0 if no such k exists, i.e., if a(n) did not appear earlier.
%H Chai Wah Wu, <a href="/A171911/b171911.txt">Table of n, a(n) for n = 1..10001</a>
%t t = {1};
%t Do[
%t d = Quiet[Check[Position[t, Last[t]][[2]][[1]], 0], Part::partw];
%t If[d == 0, x = 0, x = Length[t]  d];
%t AppendTo[t, x], 100]
%t t (* _Horst H. Manninger_, Aug 03 2020 *)
%o (Python)
%o A171911_list, l = [1, 0], 0
%o for n in range(1, 10**4):
%o for m in range(n1, 1, 1):
%o if A171911_list[m] == l:
%o l = nm
%o break
%o else: # break did not occur
%o l = 0
%o A171911_list.append(l) # _Chai Wah Wu_, Jan 02 2015
%o (PARI) A171911_vec(N,a=1,i=Map())={vector(N,n,a=if(n>1,iferr(nmapget(i,a),E,0)+mapput(i,a,n),a))} \\ _M. F. Hasler_, Jun 11 2019
%Y Cf. A181391, A171912, A171913, A171914, A171915, A171916, A171917, A171918 (same but starting with 0, 2, ..., 8).
%K nonn
%O 1,5
%A _N. J. A. Sloane_, Oct 22 2010
%E Edited by _M. F. Hasler_, Jun 11 2019
