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.

A050196 a(1) = 1, a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = a(n-1) + a(n-2).

This page as a plain text file.
%I A050196 #20 Oct 15 2019 11:53:44
%S A050196 1,1,2,3,5,8,4,12,6,18,9,27,13,40,20,10,30,15,7,22,11,33,16,49,24,73,
%T A050196 36,109,54,163,81,244,122,61,183,91,45,136,68,34,17,51,25,76,38,19,57,
%U A050196 28,14,42,21,63,31,94,47,23,70,35,105,52,26
%N A050196 a(1) = 1, a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = a(n-1) + a(n-2).
%H A050196 Ivan Neretin, <a href="/A050196/b050196.txt">Table of n, a(n) for n = 1..10000</a>
%t A050196 Nest[Append[#, If[MemberQ[Append[#, 0], r = Quotient[#[[-1]], 2]], #[[-1]] + #[[-2]], r]] &, {1, 1}, 59] (* _Ivan Neretin_, Mar 02 2016 *)
%Y A050196 Cf. A050000.
%K A050196 nonn
%O A050196 1,3
%A A050196 _Clark Kimberling_