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 A122014 #17 Jun 02 2025 14:34:53
%S A122014 1,11,40,42,179,181,773,790,3363,3460,14705,15175,64448,66594,282739,
%T A122014 292313,1240921,1283234,5447271,5633552,23913649,24732419,104984728,
%U A122014 108581082,460905635,476697757,2023486253,2092823614,8883609963
%N A122014 Expansion of -x*(8*x^7-33*x^6-30*x^5+88*x^4+35*x^3-33*x^2-11*x-1)/((x^4-x^3-3*x^2+x+1)*(x^4+x^3-3*x^2-x+1)).
%H A122014 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (0, 7, 0, -13, 0, 7, 0, -1).
%F A122014 G.f.: -x*(8*x^7-33*x^6-30*x^5+88*x^4+35*x^3-33*x^2-11*x-1)/((x^4-x^3-3*x^2+x+1)*(x^4+x^3-3*x^2-x+1)). [_Colin Barker_, Aug 02 2012]
%t A122014 M = {{0, 1, 1, 0, 0, 1, 0, 0}, {1, 0, 0, 1, 0, 0, 1, 0}, {1, 0, 0, 0, 0, 0, 0, 1}, {0, 1, 0, 0, 1, 0, 0, 0}, {0, 0, 0, 1, 0, 0, 0, 0}, {1, 0, 0, 0, 0, 0, 0, 0}, {0, 1, 0, 0, 0, 0, 0, 0}, {0, 0, 1, 0, 0, 0, 0, 0}} v[1] = Table[Fibonacci[n], {n, 1, 8}] v[n_] := v[n] = M.v[n - 1] a = Table[Floor[v[n][[1]]], {n, 1, 50}]
%t A122014 LinearRecurrence[{0,7,0,-13,0,7,0,-1},{1,11,40,42,179,181,773,790},30] (* _Harvey P. Dale_, Jun 02 2025 *)
%K A122014 nonn,easy,less
%O A122014 1,2
%A A122014 _Roger L. Bagula_, Sep 11 2006
%E A122014 Definition reformulated (with Barker's formula) from _Joerg Arndt_, Aug 02 2012