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 A173388 #13 Oct 03 2018 16:10:27 %S A173388 1,1,1,1,2,2,2,4,4,6,6,10,10,16,16,26,26,42,42,68,68,110,110,178,178, %T A173388 288,288,466,466,754,754,1220,1220,1974,1974,3194,3194,5168,5168,8362, %U A173388 8362,13530,13530,21892,21892,35422,35422,57314,57314,92736,92736 %N A173388 a(n) = a(n - 3) + a(n - 4) if n is even, else a(n - 2) + a(n - 3). %C A173388 The sequence is designed so that all the numbers, see A055389 or A006355, except the first two appear twice. %C A173388 The limiting ratio a(n+1)/a(n) alternates between the golden ratio and one. %C A173388 Essentially the same as A214927 (except for the first 4 terms and the offset). - _Georg Fischer_, Oct 01 2018 %F A173388 a(n) = a(n-2)+a(n-4), n > 7. %F A173388 G.f.: (x^7+1+x-x^6)/(1-x^2-x^4). %t A173388 a[0] = 1; a[1] = 1; a[2] = 1; a[3] = 1; %t A173388 a[n_] := a[n] = If[Mod[n, 2] == 0, a[n - 3] + a[n - 4], a[n - 2] + a[n - 3]]; %t A173388 Table[a[n], {n, 0, 50}] %K A173388 nonn,easy,less %O A173388 0,5 %A A173388 _Roger L. Bagula_, Feb 17 2010 %E A173388 Formula added by the Assoc. Editors of the OEIS, Feb 24 2010