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.

A325539 a(n) is the least number not 2*a(m)+1 or 3*a(m)+2 for any m < n.

This page as a plain text file.
%I A325539 #6 May 07 2019 23:14:43
%S A325539 1,2,4,6,7,10,11,12,16,17,18,19,22,24,26,27,28,29,30,31,34,36,40,41,
%T A325539 42,43,44,46,47,48,51,52,54,58,60,62,64,65,66,67,70,71,72,75,76,77,78,
%U A325539 79,82,84,88,90,91,94,96,98,99,100,101,102,106,107,108,111
%N A325539 a(n) is the least number not 2*a(m)+1 or 3*a(m)+2 for any m < n.
%H A325539 Clark Kimberling, <a href="/A325539/b325539.txt">Table of n, a(n) for n = 1..10000</a>
%e A325539 The sequence necessarily starts with 1.  The next 2 terms are determined as follows:  because a(1) = 1, the numbers 3 and 5 are disallowed, so that a(2) = 2, whence the number 8 is disallowed, and a(3) = 4.  See A325417 for a guide to related sequences.
%t A325539 a = {1}; Do[AppendTo[a, NestWhile[# + 1 &, Last[a] + 1,
%t A325539 Apply[Or, Map[MemberQ[a, #] &,  Select[Flatten[{(# - 1)/2, (# - 2)/3}],
%t A325539 IntegerQ]]] &]], {200}]; a       (* A325539 *)
%t A325539 Complement[Range[Last[a]], a]    (* A325540 *)
%t A325539 (* _Peter J. C. Moses_, Apr 25 2019 *)
%Y A325539 Cf. A325417, A325540.
%K A325539 nonn,easy
%O A325539 1,2
%A A325539 _Clark Kimberling_, May 07 2019