The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091913 Triangle read by rows: a(n,k) = C(n,k)*(2^(n-k) - 1) for k=n, where k=0...max(n-1,0). 1
 0, 1, 3, 2, 7, 9, 3, 15, 28, 18, 4, 31, 75, 70, 30, 5, 63, 186, 225, 140, 45, 6, 127, 441, 651, 525, 245, 63, 7, 255, 1016, 1764, 1736, 1050, 392, 84, 8, 511, 2295, 4572, 5292, 3906, 1890, 588, 108, 9, 1023, 5110, 11475, 15240, 13230, 7812, 3150, 840, 135, 10, 2047 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Row lengths are 1,1,2,3,4,... = A028310. - M. F. Hasler, Jul 21 2012 Rows: Sum of the n-th row = A001047(n); Sum of the n-th row excluding column 0 = A028243(n+1). Columns: a(n,0) = A000225(n); a(n,1) = A058877(n). Diagonals: a(n,n-2) = A045943(n-1). Also note that the sums of the antidiagonals = A006684. As an infinite lower triangular matrix * the Bernoulli numbers as a vector (Cf. A027641) = the natural numbers: [1, 2, 3,...]. The same matrix * the Bernoulli number version starting [1, 1/2, 1/6,...] = A001787: (1, 4, 12, 32,...). - Gary W. Adamson, Mar 13 2012 LINKS FORMULA For k>=n, a(n, k) = 0; for k

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 27 06:38 EST 2020. Contains 338678 sequences. (Running on oeis4.)