# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a154325
Showing 1-1 of 1

%I A154325 #13 Jun 05 2021 06:48:24
%S A154325 1,1,1,1,2,1,1,2,2,1,1,2,2,2,1,1,2,2,2,2,1,1,2,2,2,2,2,1,1,2,2,2,2,2,
%T A154325 2,1,1,2,2,2,2,2,2,2,1,1,2,2,2,2,2,2,2,2,1,1,2,2,2,2,2,2,2,2,2,1
%N A154325 Triangle with interior all 2's and borders 1.
%C A154325 This triangle follows a general construction method as follows: Let a(n) be an integer sequence with a(0)=1, a(1)=1. Then T(n,k,r):=[k<=n](1+r*a(k)*a(n-k)) defines a symmetrical triangle.
%C A154325 Row sums are n + 1 + r*Sum_{k=0..n} a(k)*a(n-k) and central coefficients are 1+r*a(n)^2.
%C A154325 Here a(n)=1-0^n and r=1. Row sums are A004277.
%C A154325 Eigensequence of the triangle = A000129, the Pell sequence. - _Gary W. Adamson_, Feb 12 2009
%C A154325 Inverse has general element T(n,k)*(-1)^(n-k). - _Paul Barry_, Oct 06 2010
%F A154325 Number triangle T(n,k) = [k<=n](2-0^(n-k)-0^k+0^(n+k))=[k<=n](2-0^(k(n-k))).
%F A154325 a(n) = 2 - A103451(n). - _Omar E. Pol_, Jan 18 2009
%e A154325 Triangle begins
%e A154325   1;
%e A154325   1, 1;
%e A154325   1, 2, 1;
%e A154325   1, 2, 2, 1;
%e A154325   1, 2, 2, 2, 1;
%e A154325   1, 2, 2, 2, 2, 1;
%e A154325   1, 2, 2, 2, 2, 2, 1;
%e A154325 From _Paul Barry_, Oct 06 2010: (Start)
%e A154325 Production matrix is
%e A154325   1,  1;
%e A154325   0,  1, 1;
%e A154325   0, -1, 0, 1;
%e A154325   0,  1, 0, 0, 1;
%e A154325   0, -1, 0, 0, 0, 1;
%e A154325   0,  1, 0, 0, 0, 0, 1;
%e A154325   0, -1, 0, 0, 0, 0, 0, 1;
%e A154325   0,  1, 0, 0, 0, 0, 0, 0, 1; (End)
%Y A154325 Cf. A129765. - _R. J. Mathar_, Jan 14 2009
%Y A154325 Cf. A103451. - _Omar E. Pol_, Jan 18 2009
%Y A154325 Cf. A000129. - _Gary W. Adamson_, Feb 12 2009
%K A154325 easy,nonn,tabl
%O A154325 0,5
%A A154325 _Paul Barry_, Jan 07 2009

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE