cp's OEIS Frontend

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.

A333549 Consider the list (A333552) of numbers m defined by property that when the Recamán term A005132(m) is being computed, we are unable to subtract m from A005132(m-1) because, although A003132(m-1) >= m, the result of the subtraction, A005132(m-1)-m, is already in A005132; sequence gives the successive values of A005132(m-1)-m.

This page as a plain text file.
%I A333549 #27 Jan 09 2021 21:04:14
%S A333549 0,1,6,3,0,7,24,21,13,45,42,0,25,90,87,84,81,78,63,163,160,157,154,39,
%T A333549 151,264,261,17,14,11,8,3,135,114,285,282,279,276,273,270,81,78,265,
%U A333549 453,63,46,269,266,263,260,257,18,15,12,9,6,3,0,228,514,511,508,505,502,499,496,493,490,164,502,499,496
%N A333549 Consider the list (A333552) of numbers m defined by property that when the Recamán term A005132(m) is being computed, we are unable to subtract m from A005132(m-1) because, although A003132(m-1) >= m, the result of the subtraction, A005132(m-1)-m, is already in A005132; sequence gives the successive values of A005132(m-1)-m.
%C A333549 These are the collisions that are avoided when A005132 is being constructed.
%H A333549 N. J. A. Sloane, <a href="/A333549/b333549.txt">Table of n, a(n) for n = 1..22288</a>
%H A333549 <a href="/index/Rea#Recaman">Index entries for sequences related to Recamán's sequence</a>
%e A333549 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. So 6 gets added to the current sequence.
%Y A333549 Cf. A005132, A333552.
%Y A333549 For records see A333550, A333551.
%K A333549 nonn
%O A333549 1,3
%A A333549 _N. J. A. Sloane_, May 02 2020