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 A208459 #6 Feb 22 2013 14:40:29 %S A208459 1,0,0,0,1,1,0,1,0,-1,0,1,0,1,2,0,1,0,2,0,-3,0,1,0,3,-1,0,5,0,1,0,4, %T A208459 -2,3,2,-8,0,1,0,5,-3,7,-2,-5,13,0,1,0,6,-4,12,-8,2,12,-21,0,1,0,7,-5, %U A208459 18,-16,15,3,-25,34 %N A208459 Triangle T_x = T(n,k) given by (0, 1/x, 1-1/x, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (x, 1/x-1, -1/x, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938, for x = 0. %C A208459 Triangle T_x : T_1 = A103631, T_2 = A208343, T_3 = A208345. %F A208459 T(n,k) = T(n-1,k) - T(n-1,k-1) + T(n-2,k-1) + T(n-2,k-2) with T(0,0) = 1 T(1,0) = 0, T(1,1) = 0, T(n,k) = 0 if k<0 or if k>n. %F A208459 G.f.: (1-x+y*x)/(1-x+y*x- y^2*x^2-y*x^2). %F A208459 Sum_{k, 0<=k<=n} T(n,k)*x^k = 12*A015548(n-1), 6*A085939(n-1), A106434(n), A000007(n), A000007(n), A077957(n), (-1)^n*A102901(n) for x = -4, -3, -2, -1, 0, 1, 2 respectively. %F A208459 Sm_{k, 0<=k<=n} T(n,k)*x^(n-k) = A000007(n), A034834(n-1), A077957(n), A052533(n), (-1)^n*A086344(n) for x = -1, 0, 1, 2, 3 respectively. %e A208459 Triangle begins : %e A208459 1 %e A208459 0, 0 %e A208459 0, 1, 1 %e A208459 0, 1, 0, -1 %e A208459 0, 1, 0, 1, 2 %e A208459 0, 1, 0, 2, 0, -3 %e A208459 0, 1, 0, 3, -1, 0, 5 %e A208459 0, 1, 0, 4, -2, 3, 2, -8 %e A208459 0, 1, 0, 5, -3, 7, -2, -5, 13 %e A208459 0, 1, 0, 6, -4, 12, -8, 2, 12, -21 %e A208459 0, 1, 0, 7, -5, 18, -16, 15, 3, -25, 34 %Y A208459 Cf. A103631, A208343, A208345, A000045 (Fibonacci) %K A208459 easy,sign,tabl %O A208459 0,15 %A A208459 _Philippe Deléham_, Feb 27 2012