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.

A050092 a(n) = floor(a(n-1)/3) if this is positive and not yet in the sequence, otherwise a(n) = 7*a(n-1).

This page as a plain text file.
%I A050092 #12 Oct 05 2019 11:31:34
%S A050092 1,7,2,14,4,28,9,3,21,147,49,16,5,35,11,77,25,8,56,18,6,42,294,98,32,
%T A050092 10,70,23,161,53,17,119,39,13,91,30,210,1470,490,163,54,378,126,882,
%U A050092 6174,2058,686,228,76,532,177,59,19,133,44,308
%N A050092 a(n) = floor(a(n-1)/3) if this is positive and not yet in the sequence, otherwise a(n) = 7*a(n-1).
%H A050092 Ivan Neretin, <a href="/A050092/b050092.txt">Table of n, a(n) for n = 1..10000</a>
%t A050092 Rest@Nest[Append[#, If[FreeQ[#, r = Quotient[#[[-1]], 3]], r, 7 #[[-1]]]] &, {0, 1}, 55] (* _Ivan Neretin_, Jul 31 2016 *)
%o A050092 (PARI) first(n)=my(v=vector(n),t); v[1]=1; for(i=2,n, t=v[i-1]\3; if(t<2, v[i]=7*v[i-1]; next); for(j=1,i-1, if(v[j]==t, v[i]=7*v[i-1]; next(2))); v[i]=t); v \\ _Charles R Greathouse IV_, Jul 31 2016
%Y A050092 Cf. A050000 and references therein.
%K A050092 nonn
%O A050092 1,2
%A A050092 _Clark Kimberling_