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 A229137 #29 Sep 23 2013 23:35:47
%S A229137 1,1,1,2,3,1,4,5,1,6,7,2,9,11,3,14,17,1,18,19,4,23,27,5,32,37,1,38,39,
%T A229137 6,45,51,7,58,65,2,67,69,9,78,87,11,98,109,3,112,115,14,129,143,17,
%U A229137 160,177,1,178,179,18,197,215,19,234,253,4,257,261,23,284
%N A229137 a(1) = a(2) = 1; if n == 0 (mod 3), then a(n) = a(n/3), otherwise a(n) = a(n-1) + a(n-2).
%C A229137 A distant cousin of Fibonacci numbers. - _T. D. Noe_, Sep 23 2013
%H A229137 T. D. Noe, <a href="/A229137/b229137.txt">Table of n, a(n) for n = 1..10000</a>
%t A229137 f[1] = f[2] = 1; f[n_] := f[n] = If[Mod[n, 3] == 0, f[n/3], (f[n - 1] + f[n - 2])]; Table[f[n], {n, 100}]
%Y A229137 Cf. A030067.
%K A229137 nonn
%O A229137 1,4
%A A229137 _José María Grau Ribas_, Sep 23 2013