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 A160191 #11 Oct 04 2014 19:30:38
%S A160191 2,1,3,4,7,11,10,5,15,12,19,23,18,9,27,20,31,35,26,13,39,28,43,47,34,
%T A160191 17,51,36,55,59,42,21,63,44,67,71,50,25,75,52,79,83,58,29,87,60,91,95,
%U A160191 66,33,99,68,103,107,74,37,111,76,115,119,82,41,123,84,127,131,90,45,135
%N A160191 Lodumo_8 of Lucas numbers.
%C A160191 Numbers congruent to {0,6} mod 8 are missing (see A047451).
%H A160191 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%F A160191 Lodumo_8 transform of A000032 (for definition see Transforms).
%F A160191 Conjecture: a(n)= +2*a(n-6) -a(n-12) . - _R. J. Mathar_, Oct 08 2011
%F A160191 Empirical g.f.: (x^11 +5*x^10 +4*x^9 +9*x^8 +3*x^7 +6*x^6 +11*x^5 +7*x^4 +4*x^3 +3*x^2 +x +2) / ((x -1)^2*(x +1)^2*(x^2 -x +1)^2*(x^2 +x +1)^2). - _Colin Barker_, Oct 04 2014
%Y A160191 Cf. A000032, A047451, A111958.
%K A160191 nonn,easy
%O A160191 0,1
%A A160191 _Philippe Deléham_, May 04 2009