A098011 -id:A098011 - cp's OEIS frontend

A003953 Expansion of g.f.: (1+x)/(1-10*x).

1, 11, 110, 1100, 11000, 110000, 1100000, 11000000, 110000000, 1100000000, 11000000000, 110000000000, 1100000000000, 11000000000000, 110000000000000, 1100000000000000, 11000000000000000

Offset: 0

N. J. A. Sloane

Coordination sequence for infinite tree with valency 11.
a(n) is sequence A003945(n-1) written in base 2: a(0)=1, a(n) for n >= 1: 2 times 1, (n-1) times 0. a(n) is also A007283(n-1) and A042950(n) for n >= 1 written in base 2. a(n) is also A098011(n+3) and A101229(n+10) for n >= 1 written in base 2. a(n) is also abs(A110164(n+1)) for n >= 1 written in base 2. - Jaroslav Krizek, Aug 17 2009
a(n) equals the numbers of words of length n on alphabet {0,1,...,10} with no two adjacent letters identical. - Milan Janjic, Jan 31 2015 [Corrected by David Nacin, Jun 02 2017]

Vincenzo Librandi, Table of n, a(n) for n = 0..200
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 312
Index to divisibility sequences
Index entries for linear recurrences with constant coefficients, signature (10).
Index entries for sequences related to trees

Cf. A003945, A003952.

k:=11;; Concatenation([1], List([1..25], n-> k*(k-1)^(n-1) )); # G. C. Greubel, Sep 24 2019

k:=11; [1] cat [k*(k-1)^(n-1): n in [1..25]]; // G. C. Greubel, Sep 24 2019

k:=11; seq(`if`(n=0, 1, k*(k-1)^(n-1)), n = 0..25); # modified by G. C. Greubel, Sep 24 2019

Join[{1}, 11*10^Range[0, 25]] (* Vladimir Joseph Stephan Orlovsky, Jul 11 2011 *)
Join[{1},NestList[10#&,11,20]] (* Harvey P. Dale, Jul 04 2025 *)

a(n)=11*10^n\10 \\ Charles R Greathouse IV, Aug 14 2015

k=11; [1]+[k*(k-1)^(n-1) for n in (1..25)] # G. C. Greubel, Sep 24 2019

a(n) = Sum_{k=0..n} A029653(n, k)*x^k for x = 9. - Philippe Deléham, Jul 10 2005
G.f.: (1+x)/(1-10*x). - Paul Barry, Mar 22 2006
a(0) = 1, a(n) = 10^n + 10^(n-1) = 11*10^(n-1) for n >= 1. - Jaroslav Krizek, Aug 17 2009
E.g.f.: (11*exp(10*x) - 1)/10. - G. C. Greubel, Sep 24 2019

Edited by N. J. A. Sloane, Dec 04 2009

A376033 Number A(n,k) of binary words of length n avoiding distance (i+1) between "1" digits if the i-th bit is set in the binary representation of k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Original entry on oeis.org

1, 1, 2, 1, 2, 4, 1, 2, 3, 8, 1, 2, 4, 5, 16, 1, 2, 3, 6, 8, 32, 1, 2, 4, 4, 9, 13, 64, 1, 2, 3, 8, 6, 15, 21, 128, 1, 2, 4, 5, 12, 9, 25, 34, 256, 1, 2, 3, 6, 7, 18, 13, 40, 55, 512, 1, 2, 4, 4, 8, 11, 27, 19, 64, 89, 1024, 1, 2, 3, 8, 5, 11, 16, 45, 28, 104, 144, 2048

Offset: 0

Alois P. Heinz, Sep 09 2024

Also the number of subsets of [n] avoiding distance (i+1) between elements if the i-th bit is set in the binary representation of k. A(6,3) = 13: {}, {1}, {2}, {3}, {4}, {5}, {6}, {1,4}, {1,5}, {1,6}, {2,5}, {2,6}, {3,6}.
Each column sequence satisfies a linear recurrence with constant coefficients.
The sequence of row n is periodic with period A011782(n) = ceiling(2^(n-1)).

			A(6,6) = 17: 000000, 000001, 000010, 000011, 000100, 000110, 001000, 001100, 010000, 010001, 011000, 100000, 100001, 100010, 100011, 110000, 110001 because 6 = 110_2 and no two "1" digits have distance 2 or 3.
A(6,7) = 10: 000000, 000001, 000010, 000100, 001000, 010000, 010001, 100000, 100001, 100010.
A(7,7) = 14: 0000000, 0000001, 0000010, 0000100, 0001000, 0010000, 0010001, 0100000, 0100001, 0100010, 1000000, 1000001, 1000010, 1000100.
Square array A(n,k) begins:
     1,  1,   1,  1,   1,  1,  1,  1,   1,  1, ...
     2,  2,   2,  2,   2,  2,  2,  2,   2,  2, ...
     4,  3,   4,  3,   4,  3,  4,  3,   4,  3, ...
     8,  5,   6,  4,   8,  5,  6,  4,   8,  5, ...
    16,  8,   9,  6,  12,  7,  8,  5,  16,  8, ...
    32, 13,  15,  9,  18, 11, 11,  7,  24, 11, ...
    64, 21,  25, 13,  27, 16, 17, 10,  36, 17, ...
   128, 34,  40, 19,  45, 25, 27, 14,  54, 25, ...
   256, 55,  64, 28,  75, 37, 41, 19,  81, 37, ...
   512, 89, 104, 41, 125, 57, 60, 26, 135, 57, ...

Alois P. Heinz, Antidiagonals n = 0..200, flattened

Columns k=0-20 give: A000079, A000045(n+2), A006498(n+2), A000930(n+2), A006500, A130137, A079972(n+3), A003269(n+4), A031923(n+1), A263710(n+1), A224809(n+4), A317669(n+4), A351873, A351874, A121832(n+4), A003520(n+4), A208742, A374737, A375977, A375980, A375978.
Rows n=0-2 give: A000012, A007395(k+1), A010702(k+1).
Main diagonal gives A376091.
A(n,2^k-1) gives A141539.
A(2^n-1,2^n-1) gives A376697.
A(n,2^k) gives A209435.
Cf. A011782, A062383, A098011, A376921.

h:= proc(n) option remember; `if`(n=0, 1, 2^(1+ilog2(n))) end:
b:= proc(n, k, t) option remember; `if`(n=0, 1, add(`if`(j=1 and
      Bits[And](t, k)>0, 0, b(n-1, k, irem(2*t+j, h(k)))), j=0..1))
    end:
A:= (n, k)-> b(n, k, 0):
seq(seq(A(n, d-n), n=0..d), d=0..12);

step(v,b)={vector(#v, i, my(j=(i-1)>>1); if(bittest(i-1,0), if(bitand(b,j)==0, v[1+j], 0), v[1+j] + v[1+#v/2+j]));}
col(n,k)={my(v=vector(2^(1+logint(k,2))), r=vector(1+n)); v[1]=r[1]=1; for(i=1, n, v=step(v,k); r[1+i]=vecsum(v)); r}
A(n,k)=if(k==0, 2^n, col(n,k)[n+1]) \\ Andrew Howroyd, Oct 03 2024

A(n,k) = A(n,k+ceiling(2^(n-1))).
A(n,ceiling(2^(n-1))-1) = n+1.
A(n,ceiling(2^(n-2))) = ceiling(3*2^(n-2)) = A098011(n+2).

A110164 Expansion of (1-x^2)/(1+2x).

Original entry on oeis.org

1, -2, 3, -6, 12, -24, 48, -96, 192, -384, 768, -1536, 3072, -6144, 12288, -24576, 49152, -98304, 196608, -393216, 786432, -1572864, 3145728, -6291456, 12582912, -25165824, 50331648, -100663296, 201326592, -402653184, 805306368, -1610612736, 3221225472

Offset: 0

Paul Barry, Jul 14 2005

Diagonal sums of Riordan array ((1-x)/(1+x),x/(1+x)^2), A110162.
The positive sequence with g.f. (1-x^2)/(1-2x) gives the row sums of the Riordan array (1+x,x/(1-x)). - Paul Barry, Jul 18 2005
The inverse g.f. is (1 + 2*x + x^2 + 2*x^3 + x^4 + 2*x^5 + x^6 + ...). - Gary W. Adamson, Jan 07 2011
In absolute value, essentially the same as A007283(n) = A003945(n+1) = A042950(n+1) = A082505(n+1) = A087009(n+3) = A091629(n) = A098011(n+4) = A111286(n+2). - M. F. Hasler, Apr 19 2015

Index entries for linear recurrences with constant coefficients, signature (-2).

Cf. A098011, A122803.

CoefficientList[Series[(1 - x^2)/(1 + 2x), {x, 0, 33}], x] (* Robert G. Wilson v, Jul 08 2006 *)
LinearRecurrence[{-2},{1,-2,3},40] (* Harvey P. Dale, May 10 2023 *)

A110164(n)=if(n>1,3*(-2)^(n-2),1-3*n) \\ M. F. Hasler, Apr 19 2015

a(n) = 3*(-2)^(n-2) = 3*A122803(n-2) for n >= 2. a(n) = -2 a(n-1) for n >= 3. - M. F. Hasler, Apr 19 2015

E.g.f.: (1/4) - (x/2) + (3/4)*exp(-2*x). - Alejandro J. Becerra Jr., Jan 29 2021

A111286 Number of permutations avoiding the patterns {1342, 1432, 2341, 2431, 3142, 3241, 3412, 3421, 4132, 4231, 4312, 4321}; number of strong sorting class based on 1342.

Original entry on oeis.org

1, 1, 2, 6, 12, 24, 48, 96, 192, 384, 768, 1536, 3072, 6144, 12288, 24576, 49152, 98304, 196608, 393216, 786432, 1572864, 3145728, 6291456, 12582912, 25165824, 50331648, 100663296, 201326592, 402653184, 805306368, 1610612736, 3221225472

Offset: 0

Len Smiley, Nov 01 2005

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
M. Albert, R. Aldred, M. Atkinson, C Handley, D. Holton, D. McCaughan and H. van Ditmarsch, Sorting Classes, Elec. J. of Comb., Vol. 12 (2005), R31.
Index entries for linear recurrences with constant coefficients, signature (2).

Cf. A003945, A007283, A042950, A098011, A110164 - differs from each by one initial term.

Table[If[n == 1, 1, If[n == 2, 2, 3*2^(n - 2)]], {n, 32}] (* Robert G. Wilson v *)
LinearRecurrence[{2},{1,2,6},40] (* Harvey P. Dale, Jul 14 2019 *)

a(n) = 3*2^(n-2), n>=3.

a(n) = 2*a(n-1) for n=3. G.f.: (1-x+2*x^3)/(1-2*x). - Colin Barker, Nov 29 2012

a(0)=1 prepended by Alois P. Heinz, Mar 12 2024

A191302 Denominators in triangle that leads to the Bernoulli numbers.

Original entry on oeis.org

1, 2, 2, 3, 2, 2, 2, 3, 15, 2, 6, 3, 2, 1, 5, 105, 2, 6, 15, 15, 2, 3, 3, 105, 105, 2, 2, 5, 7, 35, 2, 3, 3, 21, 21, 231, 2, 6, 15, 15, 21, 21, 2, 1, 5, 15, 1, 77, 15015, 2, 6, 3, 35, 15, 33, 1155

Offset: 0

Paul Curtz, May 30 2011

For the definition of the ASPEC array coefficients see the formulas; see also A029635 (Lucas triangle), A097207 and A191662 (k-dimensional square pyramidal numbers).
The antidiagonal row sums of the ASPEC array equal A042950(n) and A098011(n+3).
The coefficients of the T(n,m) array are defined in A190339. We define the coefficients of the SBD array with the aid of the T(n,n+1), see the formulas and the examples.
Multiplication of the coefficients in the rows of the ASPEC array with the coefficients in the columns of the SBD array leads to the coefficients of the BSPEC triangle, see the formulas. The BSPEC triangle can be looked upon as a spectrum for the Bernoulli numbers.
The row sums of the BSPEC triangle give the Bernoulli numbers A164555(n)/A027642(n).
For the numerators of the BSPEC triangle coefficients see A192456.

			The first few rows of the array ASPEC array:
  2, 1,  1,  1,   1,   1,    1,
  2, 3,  4,  5,   6,   7,    8,
  2, 5,  9, 14,  20,  27,   35,
  2, 7, 16, 30,  50,  77,  112,
  2, 9, 25, 55, 105, 182,  294,
The first few T(n,n+1) = T(n,n)/2 coefficients:
1/2, -1/6, 1/15, -4/105, 4/105, -16/231, 3056/15015, ...
The first few rows of the SBD array:
  1/2,   0,   0,     0
  1/2,   0,   0,     0
  1/2, -1/6,  0,     0
  1/2, -1/6,  0,     0
  1/2, -1/6, 1/15,   0
  1/2, -1/6, 1/15,   0
  1/2, -1/6, 1/15, -4/105
  1/2, -1/6, 1/15, -4/105
The first few rows of the BSPEC triangle:
  B(0) =   1   = 1/1
  B(1) =  1/2  = 1/2
  B(2) =  1/6  = 1/2 - 1/3
  B(3) =   0   = 1/2 - 1/2
  B(4) = -1/30 = 1/2 - 2/3 +  2/15
  B(5) =   0   = 1/2 - 5/6 +  1/3
  B(6) =  1/42 = 1/2 - 1/1 +  3/5  - 8/105
  B(7) =   0   = 1/2 - 7/6 + 14/15 - 4/15

Cf. A028246 (Worpitzky), A085737/A085738 (Conway-Sloane) and A051714/A051715 (Akiyama-Tanigawa) for other triangles that lead to the Bernoulli numbers. - Johannes W. Meijer, Jul 02 2011

nmax:=13: mmax:=nmax:
A164555:=proc(n): if n=1 then 1 else numer(bernoulli(n)) fi: end:
A027642:=proc(n): if n=1 then 2 else denom(bernoulli(n)) fi: end:
for m from 0 to 2*mmax do T(0,m):=A164555(m)/A027642(m) od:
for n from 1 to nmax do for m from 0 to 2*mmax do T(n,m):=T(n-1,m+1)-T(n-1,m) od: od:
seq(T(n,n+1),n=0..nmax):
for n from 0 to nmax do ASPEC(n,0):=2: for m from 1 to mmax do ASPEC(n,m):= (2*n+m)*binomial(n+m-1,m-1)/m od: od:
for n from 0 to nmax do seq(ASPEC(n,m),m=0..mmax) od:
for n from 0 to nmax do for m from 0 to 2*mmax do SBD(n,m):=0 od: od:
for m from 0 to mmax do for n from 2*m to nmax do SBD(n,m):= T(m,m+1) od: od:
for n from 0 to nmax do seq(SBD(n,m), m= 0..mmax/2) od:
for n from 0 to nmax do BSPEC(n,2) := SBD(n,2)*ASPEC(2,n-4) od:
for m from 0 to mmax do for n from 0 to nmax do BSPEC(n,m) := SBD(n,m)*ASPEC(m,n-2*m) od: od:
for n from 0 to nmax do seq(BSPEC(n,m), m=0..mmax/2) od:
seq(add(BSPEC(n, k), k=0..floor(n/2)) ,n=0..nmax):
Tx:=0:
for n from 0 to nmax do for m from 0 to floor(n/2) do a(Tx):= denom(BSPEC(n,m)): Tx:=Tx+1: od: od:
seq(a(n),n=0..Tx-1); # Johannes W. Meijer, Jul 02 2011

(* a=ASPEC, b=BSPEC *) nmax = 13; a[n_, 0] = 2; a[n_, m_] := (2n+m)*Binomial[n+m-1, m-1]/m; b[n_] := BernoulliB[n]; b[1]=1/2; bb = Table[b[n], {n, 0, nmax}]; diff = Table[ Differences[bb, n], {n, 1, nmax}]; dd = Diagonal[diff]; sbd[n_, m_] := If[n >= 2m, -dd[[m+1]], 0]; b[n_, m_] := sbd[n, m]*a[m, n-2m]; Table[b[n, m], {n, 0, nmax}, {m, 0, Floor[n/2]}] // Flatten // Denominator (* Jean-François Alcover_, Aug 09 2012 *)

ASPEC(n, 0) = 2 and ASPEC(n, m) = (2*n+m)*binomial(n+m-1, m-1)/m, n >= 0, m >= 1.
ASPEC(n, m) = ASPEC(n-1, m) + ASPEC(n, m-1), n >= 1, m >= 1, with ASPEC(n, 0) = 2, n >= 0, and ASPEC(0,m) = 1, m >= 1.
SBD(n, m) = T(m, m+1), n >= 2*m; see A190339 for the definition of the T(n, m).
BSPEC(n, m) = SBD(n, m)*ASPEC(m, n-2*m)
Sum_{k=0..floor(n/2)} BSPEC(n, k) = A164555(n)/A027642(n).

Edited, Maple program and crossrefs added by Johannes W. Meijer, Jul 02 2011

A167182 a(0)=1, a(1)=2; for n>=2, a(n) = 2^A042950(n-2).

Original entry on oeis.org

1, 2, 4, 8, 64, 4096, 16777216, 281474976710656, 79228162514264337593543950336, 6277101735386680763835789423207666416102355444464034512896

Offset: 0

Giovanni Teofilatto, Oct 29 2009

nonn

Term a(13) has 925 decimal digits; a(14) has 1850 decimal digits. - Michael De Vlieger, Jan 07 2015

Michael De Vlieger, Table of n, a(n) for n = 0..13 [a(0)=1 from _Georg Fischer_, Jun 25 2021]

Cf. A042950, A098011, A165426, A172489, A173260, A175129.

Join[{2,4},NestList[#^2&,8,10]] (* Harvey P. Dale, Nov 30 2019 *)
Table[2^Ceiling[3 2^(i - 3)], {i, 8}] (* Trevor Cappallo, Apr 21 2021 *)

a(n) = (a(n-1))^2 for n > 3.

a(n) = 2^A098011(n+1). - R. J. Mathar, Apr 22 2010

Definition corrected by R. J. Mathar, Apr 22 2010
More terms from Vincenzo Librandi, Apr 25 2010
Entry revised by N. J. A. Sloane, Jun 20 2021

A173457 Number of cell turned "ON" at n-th stage of cellular automaton of A173456.

Original entry on oeis.org

0, 1, 8, 12, 4, 28, 36, 4, 28, 36, 12, 84, 108, 4, 28, 36, 12, 84, 108, 12, 84, 108, 36, 252, 324, 4, 28, 36, 12, 84, 108, 12, 84, 108, 36, 252, 324, 12, 84, 108, 36, 252, 324, 36, 252, 324, 108, 756, 972, 4, 28, 36, 12, 84, 108, 12, 84, 108, 36, 252, 324

Offset: 0

Omar E. Pol, Feb 18 2010

Essentially the first differences of A173456.

It appears that row lengths give A098011. After the initial zero, it appears that row lengths give the absolute values of A110164. - Omar E. Pol, Apr 22 2013

			From Omar E. Pol, Apr 22 2013 (Start):
When written as an irregular triangle begins:
0;
1;
8,12;
4,28,36;
4,28,36,12,84,108;
4,28,36,12,84,108,12,84,108,36,252,324;
4,28,36,12,84,108,12,84,108,36,252,324,12,84,108,36,252,324,36,252,324,108,756,972;
4,28,36,12,84,108,12,84,108,36,252,324,...
(End)

Lars Blomberg, Table of n, a(n) for n = 0..6000
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

Cf. A139250, A139251, A173456, A173458, A173459, A173461.

a(0)=0, a(1)=1, a(2)=8, a(3)=12, for n>=4 when (n MOD 3)=0,1,2 let m=36,4,28 then a(n)=m*A147610((n + 2) / 3). (Found empirically) [Lars Blomberg, Apr 22 2013]

a(41)-a(60) from Lars Blomberg, Apr 22 2013

A348357 Square array T(n, k), n, k > 0, read by antidiagonal upwards; the k-th column contains, in ascending order, the integers m such that A348331(m) = k.

Original entry on oeis.org

1, 2, 4, 3, 5, 7, 6, 9, 8, 10, 12, 18, 15, 11, 13, 24, 36, 30, 21, 14, 16, 48, 72, 60, 42, 27, 17, 19, 96, 144, 120, 84, 54, 33, 20, 22, 192, 288, 240, 168, 108, 66, 39, 23, 25, 384, 576, 480, 336, 216, 132, 78, 45, 26, 28, 768, 1152, 960, 672, 432, 264, 156, 90, 51, 29, 31

Offset: 1

Rémy Sigrist, Oct 14 2021

When interpreted as a flat array, we have a permutation of the positive integers.

			Array T(n, k) begins:
  n\k|    1     2     3     4     5     6     7     8     9    10
  ---+-----------------------------------------------------------
    1|    1     4     7    10    13    16    19    22    25    28
    2|    2     5     8    11    14    17    20    23    26    29
    3|    3     9    15    21    27    33    39    45    51    57
    4|    6    18    30    42    54    66    78    90   102   114
    5|   12    36    60    84   108   132   156   180   204   228
    6|   24    72   120   168   216   264   312   360   408   456
    7|   48   144   240   336   432   528   624   720   816   912
    8|   96   288   480   672   864  1056  1248  1440  1632  1824
    9|  192   576   960  1344  1728  2112  2496  2880  3264  3648
   10|  384  1152  1920  2688  3456  4224  4992  5760  6528  7296

Rémy Sigrist, PARI program for A348357
Index entries for sequences that are permutations of the natural numbers

Cf. A098011, A348331, A348356.

PARI
```
See Links section.
```

Sum_{i = 1..n-1} T(i, k) <= T(n, k).

T(n, 1) = A098011(n+1).

A119440 Triangle read by rows: T(n,k) is the number of binary sequences of length n that start with exactly k 01's (0 <= k <= floor(n/2)).

Original entry on oeis.org

1, 2, 3, 1, 6, 2, 12, 3, 1, 24, 6, 2, 48, 12, 3, 1, 96, 24, 6, 2, 192, 48, 12, 3, 1, 384, 96, 24, 6, 2, 768, 192, 48, 12, 3, 1, 1536, 384, 96, 24, 6, 2, 3072, 768, 192, 48, 12, 3, 1, 6144, 1536, 384, 96, 24, 6, 2, 12288, 3072, 768, 192, 48, 12, 3, 1, 24576, 6144, 1536, 384, 96

Offset: 0

Emeric Deutsch, May 19 2006

Row n contains 1+floor(n/2) terms.
Sum of entries in row n is 2^n (A000079).
T(n,0)=A098011(n+2). Except for a shift, all columns are identical.
G.f. of column k is x^(2k)*(1-x^2)/(1-2x).
Sum_{k=0..floor(n/2)} k*T(n,k) = A000975(n-1).

			T(6,2)=3 because we have 010100, 010110 and 010111.
Triangle starts:
   1;
   2;
   3,  1;
   6,  2;
  12,  3,  1;
  24,  6,  2;
  48, 12,  3,  1;

G. C. Greubel, Table of n, a(n) for the first 100 rows, flattened

Cf. A000079, A000975, A098011.

T:=proc(n,k) if 2*k+2<=n then 3*2^(n-2*k-2) elif n=2*k then 1 elif n=2*k+1 then 2 else 0 fi end: for n from 0 to 16 do seq(T(n,k),k=0..floor(n/2)) od; # yields sequence in triangular form

nn=15;a=1/(1-y x^2);c=1/(1-2x);Map[Select[#,#>0&]&,CoefficientList[Series[1+x c+x^2 a c+x a +x^2y a+x^3y a c,{x,0,nn}],{x,y}]]//Grid (* Geoffrey Critzer, Jan 03 2014 *)
CoefficientList[CoefficientList[Series[(1 - x^2)/((1 - 2*x)*(1 - y*x^2)), {x, 0, 10}, {y, 0, 10}], x], y] // Flatten (* G. C. Greubel, Oct 10 2017 *)

T(n,k) = 3*2^(n-2k-2) for n >= 2k+2; T(2k,k)=1; T(2k+1,k)=2.

G.f.: G(t,x) = (1-x^2)/((1-2*x)*(1-t*x^2)).

A131084 A129686 * A007318. Riordan triangle (1+x, x/(1-x)).

Original entry on oeis.org

1, 1, 1, 0, 2, 1, 0, 2, 3, 1, 0, 2, 5, 4, 1, 0, 2, 7, 9, 5, 1, 0, 2, 9, 16, 14, 6, 1, 0, 2, 11, 25, 30, 20, 7, 1, 0, 2, 13, 36, 55, 50, 27, 8, 1, 0, 2, 15, 49, 91, 105, 77, 35, 9, 1

Offset: 1

Gary W. Adamson, Jun 14 2007

Row sums = A098011 starting (1, 2, 3, 6, 12, 24, 48, ...). A131085 = A007318 * A129686

Riordan array (1+x, x/(1-x)). - Philippe Deléham, Mar 02 2012

			The triangle T(n, k) begins:
n\k 0  1  2  3   4   5   6   7  8  9 10 ...
0:  1
1:  1  1
2:  0  2  1
3:  0  2  3  1
4:  0  2  5  4   1
5:  0  2  7  9   5   1
6:  0  2  9 16  14   6   1
7:  0  2 11 25  30  20   7   1
8:  0  2 13 36  55  50  27   8  1
9:  0  2 15 49  91 105  77  35  9  1
10: 0  2 17 64 140 196 182 112 44 10  1
... Reformatted. - _Wolfdieter Lang_, Jan 06 2015

Cf. A007318, A129686, A098011, A131085.

Cf. A029653, A131084, A208510.

A129686(signed): (1,1,1,...) in the main diagonal and (-1,-1,-1, ...) in the subsubdiagonal); * A007318, Pascal's triangle; as infinite lower triangular matrices.
exp(x) * e.g.f. for row n = e.g.f. for diagonal n. For example, for n = 3 we have exp(x)*(2*x + 3*x^2/2! + x^3/3!) = 2*x + 7*x^2/2! + 16*x^3/3! + 30*x^4/4! + .... The same property holds more generally for Riordan arrays of the form ( f(x), x/(1 - x) ). - Peter Bala, Dec 22 2014
G.f. column k: (1+x)*(x/(1-x))^k, k >= 0. (Riordan property). - Wolfdieter Lang, Jan 06 2015
T(n, 0) = 1 if n=0 or n=1 else 0; T(n, k) = binomial(n-1,k-1) + binomial(n-2,k-1)*[n-1 >= k] if n >= k >= 1, where [S] = 1 if S is true, else 0, and  T(n, k) = 0 if n < k. - Wolfdieter Lang, Jan 08 2015

Edited: Added Riordan property (see Philippe Deléham comment) in name. - Wolfdieter Lang, Jan 06 2015

cp's OEIS Frontend

A003953 Expansion of g.f.: (1+x)/(1-10*x).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A376033 Number A(n,k) of binary words of length n avoiding distance (i+1) between "1" digits if the i-th bit is set in the binary representation of k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

PARI

Formula

A110164 Expansion of (1-x^2)/(1+2x).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A111286 Number of permutations avoiding the patterns {1342, 1432, 2341, 2431, 3142, 3241, 3412, 3421, 4132, 4231, 4312, 4321}; number of strong sorting class based on 1342.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A191302 Denominators in triangle that leads to the Bernoulli numbers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A167182 a(0)=1, a(1)=2; for n>=2, a(n) = 2^A042950(n-2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A173457 Number of cell turned "ON" at n-th stage of cellular automaton of A173456.

Views

Author

Keywords

Comments

Examples

Links