cp's OEIS Frontend

A171370 Sequence generated from Lim:_{n..inf.} M^n, M = an infinite lower triangular matrix with (1,3,3,3,...) in every column, shifted down twice.

%I A171370 #9 Apr 16 2014 12:35:51
%S A171370 1,3,6,12,18,30,42,66,84,120,150,210,252,336,402,534,618,786,906,1146,
%T A171370 1296,1596,1806,2226,2478,2982,3318,3990,4392,5196,5730,6798,7416,
%U A171370 8652,9438,11010,11916,13728,14874,17166,18462,21054,22650,25842,27648,31260
%N A171370 Sequence generated from Lim:_{n..inf.} M^n, M = an infinite lower triangular matrix with (1,3,3,3,...) in every column, shifted down twice.
%C A171370 A000123 can be generated through an analogous procedure replacing (1,3,3,3,...) with (1,2,2,2,...).
%C A171370 A171370 has the property that (1, 3, 6, 12, 18,...) / (1, 3, 3, 3,..) generates an aerated variant: (1, 0, 3, 0, 6, 0, 12,...).
%C A171370 Similarly, given A000123; (1, 2, 4, 6, 10, 14,...) / (1, 2, 2, 2,...) generates an aerated variant: (1, 0, 2, 0, 6, 0, 10,...).
%C A171370 Row sums of the generating triangle = A032766 starting with 1. - _Gary W. Adamson_, Feb 15 2010
%H A171370 Alois P. Heinz, <a href="/A171370/b171370.txt">Table of n, a(n) for n = 0..200</a>
%F A171370 Let M = an infinite lower triangular matrix with (1,3,3,3,...) in every column shifted down twice:
%F A171370 1;
%F A171370 3;
%F A171370 3, 1;
%F A171370 3, 3;
%F A171370 3, 3, 1;
%F A171370 3, 3, 3;
%F A171370 ...
%F A171370 Sequence A171370 = Lim:_{n..inf.} M^n, the left-shifted vector considered as a sequence.
%p A171370 a:= n-> (Matrix(n+1, (i, j)-> `if`(i=2*j-1, 1,
%p A171370         `if`(i>2*j-1, 3, 0)))^n)[n+1, 1]:
%p A171370 seq(a(n), n=0..50);  # _Alois P. Heinz_, Apr 16 2014
%Y A171370 Cf. A000123.
%Y A171370 Cf. A032766. - _Gary W. Adamson_, Feb 15 2010
%K A171370 nonn
%O A171370 0,2
%A A171370 _Gary W. Adamson_, Dec 06 2009
%E A171370 a(20)-a(45) from _Alois P. Heinz_, Apr 16 2014