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 A069008 #20 Mar 26 2024 06:04:16 %S A069008 1,4,18,74,309,1280,5313,22035,91410,379171,1572857,6524375,27063881, %T A069008 112264055,465684247,1931711700,8012962189,33238687760,137877896315, %U A069008 571933356551,2372445281505,9841175633650,40822327332150,169335704473650,702423959724591 %N A069008 Let M denote the 6 X 6 matrix with rows /1,1,1,1,1,1/1,1,1,1,1,0/1,1,1,1,0,0/1,1,1,0,0,0/1,1,0,0,0,0/1,0,0,0,0,0/ and A(n) the vector (x(n),y(n),z(n),t(n),u(n),v(n)) = M^n*A where A is the vector (1,1,1,1,1,1); then a(n) = z(n). %H A069008 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (3,6,-4,-5,1,1). %F A069008 G.f.: -(x+1) / (x^6+x^5-5*x^4-4*x^3+6*x^2+3*x-1). - _Colin Barker_, Jun 14 2013 %p A069008 a:= n->(Matrix(6, (i, j)->`if`(i+j>7, 0, 1))^n.<<[1$6][]>>)[3, 1]: %p A069008 seq(a(n), n=0..30); # _Alois P. Heinz_, Jun 14 2013 %t A069008 m = Table[ If[i + j <= 7, 1, 0], {i, 1, 6}, {j, 1, 6}]; mp[n_] := MatrixPower[m, n].m[[1]]; a[n_] := mp[n][[3]]; Table[a[n], {n, 0, 24}] (* _Jean-François Alcover_, Jun 18 2013 *) %Y A069008 Cf. A006359, A069007, A069008, A069009, A070778, A006359 (offset), for x(n), y(n), z(n), t(n), u(n), v(n). %K A069008 easy,nonn %O A069008 0,2 %A A069008 _Benoit Cloitre_, Apr 02 2002 %E A069008 Edited by _Henry Bottomley_, May 06 2002