This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A333553 #20 Jul 09 2025 04:52:10 %S A333553 3,6,7,18,19,34,67,102,115,173,190,288,453,511,677,846,986,1230,1305, %T A333553 1349,1715,2066,2422,2870,3870,4139,4599,4649,5027,5899,7676,8220, %U A333553 8742,9558,11542,13144,13511,15541,16001,16281,16685,17199,18279,19463,21267,23375,23976,24260,24381,24398,24399,55506,68108,75688 %N A333553 a(n) = A333552(A333551(n)): indices of terms in Recamán's sequence A005132 where the construction avoided a record-sized collision. %H A333553 Rémy Sigrist, <a href="/A333553/b333553.txt">Table of n, a(n) for n = 1..365</a> %H A333553 <a href="/index/Rea#Recaman">Index entries for sequences related to Recamán's sequence</a> %H A333553 Rémy Sigrist, <a href="/A333553/a333553.txt">C++ program for A333553</a> %e A333553 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 A333553 (C++) See Links section. %Y A333553 Cf. A005132, A333548, A333549, A333550, A333551, A333552. %K A333553 nonn %O A333553 1,1 %A A333553 _N. J. A. Sloane_, May 03 2020, following a suggestion from Paul Zimmermann