|
%I #20 Dec 21 2021 12:19:30
%S 0,2,2,1,2,2,1,3,2,3,2,2,1,6,2,3,6,3,2,4,2,2,1,10,2,3,8,2,3,3,1,8,5,2,
%T 6,18,2,3,8,7,2,4,22,2,3,7,6,12,2,5,17,2,3,8,15,2,4,15,3,6,13,2,6,3,5,
%U 15,8,13,7,23,2,9,2,2,1,44
%N Van Eck's sequence (cf. A181391), but outputting 2 for a new number, not 0.
%C After the initial value, the sequence is extended by a(n+1) = min { k > 0: a(n-k) = a(n) } or 2 if no such k exists, i.e., if a(n) did not appear earlier.
%C Although the sequence has properties that are superficially similar to the original A181391, there is an important difference. Using a positive number m instead of 0 to mark a new value means there is no 1-to-1 correspondence between the occurrence of a new value and the occurrence of m. - _Jan Ritsema van Eck_, Aug 14 2019
%H Rémy Sigrist, <a href="/A309363/b309363.txt">Table of n, a(n) for n = 1..25000</a>
%o (Python)
%o from itertools import count, islice
%o def A309363gen(): # generator of terms
%o b, bdict = 0, {0:(1,)}
%o for n in count(2):
%o yield b
%o if len(l := bdict[b]) > 1:
%o b = n-1-l[-2]
%o else:
%o b = 2
%o if b in bdict:
%o bdict[b] = (bdict[b][-1],n)
%o else:
%o bdict[b] = (n,)
%o A309363_list = list(islice(A309363gen(),20)) # _Chai Wah Wu_, Dec 21 2021
%Y Cf. A181391, A171911, ..., A171918 (same but starting with 0, 1, 2, ..., 8 and returning 0 when a new term appears).
%K nonn
%O 1,2
%A _Nicholas FitzGerald_, Jul 25 2019
|
