A333553 - OEIS

%I #18 Jan 09 2021 21:04:27

%S 3,6,7,18,19,34,67,102,115,173,190,288,453,511,677,846,986,1230,1305,

%T 1349,1715,2066,2422,2870,3870,4139,4599,4649,5027,5899,7676,8220,

%U 8742,9558,11542,13144,13511,15541,16001,16281,16685,17199,18279,19463,21267,23375,23976,24260,24381,24398,24399,55506,68108,75688

%N a(n) = A333552(A333551(n)): indices of terms in Recamán's sequence A005132 where the construction avoided a record-sized collision.

%H Rémy Sigrist, <a href="/A333553/b333553.txt">Table of n, a(n) for n = 1..365</a>

%H <a href="/index/Rea#Recaman">Index entries for sequences related to Recamán's sequence</a>

%H Rémy Sigrist, <a href="/A333553/a333553.txt">C++ program for A333553</a>

%e After we have found A005132(6)=13, we attempt to subtract 7 from 13 to get a(7). However, this would give 6, which is a collision, since we already have A005132(3)=6. Furthermore, 6 is larger than any collision we have so far avoided. So 7 (the index of the term of A005132 that we were constructing), gets added to the current sequence (it is a(3)).

%o (C++) See Links section.

%Y Cf. A005132, A333548, A333549, A333550, A333551, A333552.

%K nonn

%O 1,1

%A _N. J. A. Sloane_, May 03 2020, following a suggestion from Paul Zimmermann.