cp's OEIS Frontend

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.

Showing 1-4 of 4 results.

A055372 Invert transform of Pascal's triangle A007318.

Original entry on oeis.org

1, 1, 1, 2, 4, 2, 4, 12, 12, 4, 8, 32, 48, 32, 8, 16, 80, 160, 160, 80, 16, 32, 192, 480, 640, 480, 192, 32, 64, 448, 1344, 2240, 2240, 1344, 448, 64, 128, 1024, 3584, 7168, 8960, 7168, 3584, 1024, 128, 256, 2304, 9216, 21504, 32256, 32256, 21504, 9216, 2304, 256
Offset: 0

Views

Author

Christian G. Bower, May 16 2000

Keywords

Comments

Triangle T(n,k), 0 <= k <= n, read by rows, given by [1, 1, 0, 0, 0, 0, 0, 0, 0, ...] DELTA [1, 1, 0, 0, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938. - Philippe Deléham, Aug 10 2005
T(n,k) is the number of nonempty bit strings with n bits and exactly k 1's over all strings in the sequence. For example, T(2,1)=4 because we have {(01)},{(10)},{(0),(1)},{(1),(0)}. - Geoffrey Critzer, Apr 06 2013

Examples

			Triangle begins:
  1;
  1,  1;
  2,  4,  2;
  4, 12, 12,  4;
  8, 32, 48, 32,  8;
  ...
		

Crossrefs

Row sums give A081294. Cf. A000079, A007318, A055373, A055374.
Cf. A134309.
T(2n,n) gives A098402.

Programs

  • Mathematica
    nn=10;f[list_]:=Select[list,#>0&];a=(x+y x)/(1-(x+y x));Map[f,CoefficientList[Series[1/(1-a),{x,0,nn}],{x,y}]]//Grid  (* Geoffrey Critzer, Apr 06 2013 *)

Formula

a(n,k) = 2^(n-1)*C(n, k), for n>0.
G.f.: A(x, y)=(1-x-xy)/(1-2x-2xy).
As an infinite lower triangular matrix, equals A134309 * A007318. - Gary W. Adamson, Oct 19 2007
Sum_{k=0..n} T(n,k)*x^k = A000007(n), A011782(n), A081294(n), A081341(n), A092811(n), A093143(n), A067419(n) for x = -1, 0, 1, 2, 3, 4, 5 respectively. - Philippe Deléham, Feb 05 2012

A134309 Triangle read by rows, where row n consists of n zeros followed by 2^(n-1).

Original entry on oeis.org

1, 0, 1, 0, 0, 2, 0, 0, 0, 4, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 32, 0, 0, 0, 0, 0, 0, 0, 64, 0, 0, 0, 0, 0, 0, 0, 0, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 256, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 512, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1024, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2048, 0, 0, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Gary W. Adamson, Oct 19 2007

Keywords

Comments

As infinite lower triangular matrices, binomial transform of A134309 = A082137. A134309 * A007318 = A055372. A134309 * [1,2,3,...] = A057711: (1, 2, 6, 16, 40, 96, 224,...).
Triangle read by rows given by [0,0,0,0,0,0,0,0,...] DELTA [1,1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938. - Philippe Deléham, Oct 20 2007

Examples

			Triangle T(n,k) (with rows n >= 0 and columns k = 0..n) begins:
  1;
  0, 1;
  0, 0, 2;
  0, 0, 0, 4;
  0, 0, 0, 0, 8;
  0, 0, 0, 0, 0, 16;
  ...
		

Crossrefs

Cf. A011782 (diagonal elements: 1 followed by 1, 2, 4, 8, ... = A000079: 2^n).

Programs

  • Mathematica
    Join[{1},Flatten[Table[Join[{PadRight[{},n],2^(n-1)}],{n,20}]]] (* Harvey P. Dale, Jan 04 2024 *)
  • PARI
    A134309(r,c)=if(r==c,2^max(r-1,0),0) \\ M. F. Hasler, Mar 29 2022

Formula

Triangle, T(0,0) = 1, then for n > 0, n zeros followed by 2^(n-1). Infinite lower triangular matrix with (1, 1, 2, 4, 8, 16, ...) in the main diagonal and the rest zeros.
G.f.: (1 - y*x)/(1 - 2*y*x). - Philippe Deléham, Feb 04 2012
Sum_{k=0..n} T(n,k)*x^k = A000007(n), A011782(n), A081294(n), A081341(n), A092811(n), A093143(n), A067419(n) for x = 0, 1, 2, 3, 4, 5, 6 respectively. - Philippe Deléham, Feb 04 2012
Diagonal is A011782, other elements are 0. - M. F. Hasler, Mar 29 2022

A013731 a(n) = 2^(3*n+2).

Original entry on oeis.org

4, 32, 256, 2048, 16384, 131072, 1048576, 8388608, 67108864, 536870912, 4294967296, 34359738368, 274877906944, 2199023255552, 17592186044416, 140737488355328, 1125899906842624, 9007199254740992, 72057594037927936, 576460752303423488, 4611686018427387904
Offset: 0

Views

Author

Keywords

Comments

Starting rank of the (j-1)-Washtenaw series for the fixed ratio 2^(-j-1) (see Griess). - J. Taylor (jt_cpp(AT)yahoo.com), Apr 03 2004
1/4 + 1/32 + 1/256 + 1/2048 + ... = 2/7. - Gary W. Adamson, Aug 29 2008
Independence number of the (n+1)-Sierpinski carpet graph. - Eric W. Weisstein, Sep 06 2017
Clique covering number of the (n+1)-Sierpinski carpet graph. - Eric W. Weisstein, Apr 22 2019

Crossrefs

Cf. A092811 (same sequence with 1 prepended).

Programs

  • Magma
    [2^(3*n+2): n in [0..20]]; // Vincenzo Librandi, Jun 26 2011
    
  • Maple
    seq(2^(3*n+2),n=0..19); # Nathaniel Johnston, Jun 26 2011
  • Mathematica
    (* Start from Eric W. Weisstein, Sep 06 2017 *)
    Table[2^(3 n + 2), {n, 0, 20}]
    2^(3 Range[0, 20] + 2)
    LinearRecurrence[{8}, {4}, 20]
    CoefficientList[Series[-(4/(-1 + 8 x)), {x, 0, 20}], x]
    (* End *)
  • PARI
    a(n)=4<<(3*n) \\ Charles R Greathouse IV, Apr 07 2012
  • Sage
    [lucas_number1(3*n, 2, 0) for n in range(1, 20)] # Zerinvary Lajos, Oct 27 2009
    

Formula

From Philippe Deléham, Nov 23 2008: (Start)
a(n) = 8*a(n-1), n > 0; a(0)=4.
G.f.: 4/(1-8x). (End)
a(n) = A198852(n) + 1. - Michel Marcus, Aug 23 2013
a(n) = A092811(n+1). - Eric W. Weisstein, Sep 06 2017
a(n) = 4*A001018(n). - R. J. Mathar, May 21 2024
E.g.f.: 4*exp(8*x). - Stefano Spezia, May 29 2024

A191687 Table T(n,k) = ceiling((1/2)*((k+1)^n+(1+(-1)^k)/2)) read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 1, 1, 4, 5, 2, 1, 1, 8, 14, 8, 3, 1, 1, 16, 41, 32, 13, 3, 1, 1, 32, 122, 128, 63, 18, 4, 1, 1, 64, 365, 512, 313, 108, 25, 4, 1, 1, 128, 1094, 2048, 1563, 648, 172, 32, 5, 1
Offset: 1

Views

Author

Adi Dani, Jun 11 2011

Keywords

Comments

T(n,k) is the number of compositions of even natural numbers into n parts <= k.

Examples

			Top left corner:
  1, 1, 1,  1,  1,...
  1, 1, 2,  2,  3,...
  1, 2, 5,  8, 13,...
  1, 4,14, 32, 63,...
  1, 8,41,128,313,...
T(2,4)=13: there are 13 compositions of even natural numbers into 2 parts <=4
0: (0,0);
2: (0,2), (2,0), (1,1);
4: (0,4), (4,0), (1,3), (3,1), (2,2);
6: (2,4), (4,2), (3,3);
8: (4,4).
		

Crossrefs

Programs

  • Mathematica
    Table[Table[Ceiling[1/2*((k+1)^n+(1+(-1)^k)/2)],{n,0,9},{k,0,9}]]
Showing 1-4 of 4 results.