A055795 -id:A055795 - cp's OEIS frontend

A115567 a(n) = C(n,6) + C(n,5) + C(n,4) + C(n,3) + C(n,2) + C(n,1).

0, 1, 3, 7, 15, 31, 63, 126, 246, 465, 847, 1485, 2509, 4095, 6475, 9948, 14892, 21777, 31179, 43795, 60459, 82159, 110055, 145498, 190050, 245505, 313911, 397593, 499177, 621615, 768211, 942648, 1149016, 1391841, 1676115, 2007327, 2391495

Offset: 0

Jonathan Vos Post, Mar 12 2006

a(n) = n + T(n) + Tet(n) + Ptop(n) + 5-Simplex(n) + 6-Simplex(n), where T(n) = n-th triangular number A000217(n), Tet(n) = n-th tetrahedral number A000292(n), Ptop(n) = n-th pentatope number A000332(n), 5-Simplex(n) = n-th 5-simplex number A000389(n), 6-Simplex(n) = n-th 6-simplex number A000579(n).

By analogy to A004006, A055795 and A057703, I presume that a(n) = Answer to the question: if you have a tall building and 6 plates and you need to find the highest story, a plate thrown from which does not break, what is the number of stories you can handle given n tries?

G. C. Greubel, Table of n, a(n) for n = 0..1000
Michael Boardman, The Egg-Drop Numbers, Mathematics Magazine, 77 (2004), 368-372. [_Parthasarathy Nambi_, Sep 30 2009]
Index entries for linear recurrences with constant coefficients, signature (7,-21,35,-35,21,-7,1).

Cf. A000217, A000332, A000389, A000292, A000579, A004006, A055795, A057703.

[n*(n + 1)*(n^4 - 10*n^3 + 65*n^2 - 140*n + 444)/720: n in [0..30]]; // G. C. Greubel, Nov 25 2017

seq(sum(binomial(n,k),k=1..6),n=0..36); # Zerinvary Lajos, Dec 13 2007

Table[n*(n + 1)*(n^4 - 10*n^3 + 65*n^2 - 140*n + 444)/720, {n,0,30}] (* G. C. Greubel, Nov 25 2017 *)

for(n=0,30, print1(n*(n + 1)*(n^4 - 10*n^3 + 65*n^2 - 140*n + 444)/720, ", ")) \\ G. C. Greubel, Nov 25 2017

[binomial(n,2)+binomial(n,4)+binomial(n,6) for n in range(1, 38)] # Zerinvary Lajos, May 17 2009

[binomial(n,1)+binomial(n,3)+binomial(n,5)+binomial(n,2)+binomial(n,4)+binomial(n,6) for n in range(0, 37)] # Zerinvary Lajos, May 17 2009

a(n) = C(n,6) + C(n,5) + C(n,4) + C(n,3) + C(n,2) + C(n,1).
a(n) = A000579(n) + A000389(n) + A000332(n) + A000292(n) + A000217(n) + n.
a(n) = A000579(n) + A057703(n).
G.f.: x*(1-x+x^2)*(1-3*x+3*x^2)/(1-x)^7. - Colin Barker, Mar 16 2012
From G. C. Greubel, Nov 25 2017: (Start)
a(n) = n*(n + 1)*(n^4 - 10*n^3 + 65*n^2 - 140*n + 444)/720.
E.g.f.: x*(720 + 360*x + 120*x^2 + 30*x^3 + 6*x^4 + x^5)*exp(x)/720. (End)

A134394 Triangle T(n,k) = Sum_{j=k..n} A077028(j,k), read by rows.

Original entry on oeis.org

1, 2, 1, 3, 3, 1, 4, 6, 4, 1, 5, 10, 9, 5, 1, 6, 15, 16, 12, 6, 1, 7, 21, 25, 22, 15, 7, 1, 8, 28, 36, 35, 28, 18, 8, 1, 9, 36, 49, 51, 45, 34, 21, 9, 1, 10, 45, 64, 70, 66, 55, 40, 24, 10, 1, 11, 55, 81, 92, 91, 81, 65, 46, 27, 11, 1, 12, 66, 100, 117, 120, 112, 96, 75, 52, 30, 12, 1, 13, 78, 121, 145, 153

Offset: 1

Gary W. Adamson, Oct 23 2007

Row sums = A055795: (1, 3, 7, 15, 30, 56, 98, ...).

Antidiagonal reading of A139600 without its left column. - R. J. Mathar, Apr 17 2011

			First few rows of the triangle:
  1;
  2,  1;
  3,  3,  1;
  4,  6,  4,  1;
  5, 10,  9,  5,  1;
  6, 15, 16, 12,  6,  1;
  7, 21, 25, 22, 15,  7,  1;

Cf. A077028, A055795, A139600.

A077028 := proc(n,k) if n < 0 or k<0 or k > n then 0; else k*(n-k)+1 ; end if; end proc:
A134394 := proc(n,k) add ( A077028(j,k),j=k..n) ; end proc:
seq(seq(A134394(n,k),k=0..n),n=0..15) ; # R. J. Mathar, Apr 17 2011

A000012 * A077028 as infinite lower triangular matrices.

T(n,k) = (k-n-1)*(k*(k-n)-2)/2. - R. J. Mathar, Apr 17 2011

A116082 a(n) = C(n,7) + C(n,6) + C(n,5) + C(n,4) + C(n,3) + C(n,2) + C(n,1).

Original entry on oeis.org

0, 1, 3, 7, 15, 31, 63, 127, 254, 501, 967, 1815, 3301, 5811, 9907, 16383, 26332, 41225, 63003, 94183, 137979, 198439, 280599, 390655, 536154, 726205, 971711, 1285623, 1683217, 2182395, 2804011, 3572223, 4514872, 5663889, 7055731, 8731847

Offset: 0

Jonathan Vos Post, Mar 13 2006

Number of compositions with at most three parts distinct from 1 and with a sum at most n. - Beimar Naranjo, Mar 12 2024

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Michael Boardman, The Egg-Drop Numbers, Mathematics Magazine, 77 (2004), 368-372. See Table 2 on page 370. [_Parthasarathy Nambi_, Jun 18 2009]
Index entries for linear recurrences with constant coefficients, signature (8,-28,56,-70,56,-28,8,-1).

Cf. A000217, A000225, A004006, A055795, A057703, A115567, A116082. [Parthasarathy Nambi, Jun 18 2009]

[n*(n^6-14*n^5+112*n^4-350*n^3+1099*n^2+364*n+3828)/5040: n in [0..40]]; // Vincenzo Librandi, Jun 21 2011

a:=n->n*(n^6-14*n^5+112*n^4-350*n^3+1099*n^2+364*n+3828)/5040: seq(a(n),n=0..35); # Emeric Deutsch, Apr 14 2006
seq(sum(binomial(n,k),k=1..7),n=0..35); # Zerinvary Lajos, Dec 14 2007

Table[Total[Binomial[n,Range[7]]],{n,0,40}] (* or *) LinearRecurrence[ {8,-28,56,-70,56,-28,8,-1},{0,1,3,7,15,31,63,127},41](* Harvey P. Dale, Aug 05 2011 *)

for(n=0,30, print1(n*(n^6 -14*n^5 +112*n^4 -350*n^3 +1099*n^2 +364*n +3828)/5040, ", ")) \\ G. C. Greubel, Nov 25 2017

a(n) = A000580(n) + A000579(n) + A000389(n) + A000332(n) + A000292(n) + A000217(n) + n.
a(n) = A000580(n) + A115567(n).
a(n) = n*(n^6 - 14*n^5 + 112*n^4 - 350*n^3 + 1099*n^2 + 364*n + 3828)/5040. - Emeric Deutsch, Apr 14 2006
G.f.: x*(1 - 5*x + 11*x^2 - 13*x^3 + 9*x^4 - 3*x^5 + x^6)/(1-x)^8. - R. J. Mathar, Jun 20 2011
a(n) = 8*a(n-1) - 28*a(n-2) + 56*a(n-3) - 70*a(n-4) + 56*a(n-5) - 28*a(n-6) + 8*a(n-7) - a(n-8), with a(0)=0, a(1)=1, a(2)=3, a(3)=7, a(4)=15, a(5)=31, a(6)=63, a(7)=127. - Harvey P. Dale, Aug 05 2011

A124725 Triangle read by rows: T(n,k) = binomial(n,k) + binomial(n,k+2) (0 <= k <= n).

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 4, 4, 3, 1, 7, 8, 7, 4, 1, 11, 15, 15, 11, 5, 1, 16, 26, 30, 26, 16, 6, 1, 22, 42, 56, 56, 42, 22, 7, 1, 29, 64, 98, 112, 98, 64, 29, 8, 1, 37, 93, 162, 210, 210, 162, 93, 37, 9, 1, 46, 130, 255, 372, 420, 372, 255, 130, 46, 10, 1, 56, 176, 385, 627, 792, 792, 627

Offset: 0

Gary W. Adamson and Roger L. Bagula, Nov 05 2006

Binomial transform of the infinite tridiagonal matrix with main diagonal, (1,1,1,...), subdiagonal, (0,0,0,...) and subsubdiagonal, (1,1,1,...). Sum of entries in row n = 2^(n+1) - n - 1 = A000325(n+1).

Riordan array ((1-2x+2x^2)/(1-x)^3, x/(1-x)). - Paul Barry, Apr 08 2011

			Row 3 = (4, 4, 3, 1), then row 4 = (7, 8, 7, 4, 1).
First few rows of the triangle are
   1;
   1,  1;
   2,  2,  1;
   4,  4,  3,  1;
   7,  8,  7,  4,  1;
  11, 15, 15, 11,  5,  1;
  16, 26, 30, 26, 16,  6,  1;
  ...
From _Paul Barry_, Apr 08 2011: (Start)
Production matrix begins
   1, 1;
   1, 1, 1;
   0, 0, 1, 1;
  -1, 0, 0, 1, 1;
   0, 0, 0, 0, 1, 1;
   1, 0, 0, 0, 0, 1, 1;
   0, 0, 0, 0, 0, 0, 1, 1;
  -1, 0, 0, 0, 0, 0, 0, 1, 1;
   0, 0, 0, 0, 0, 0, 0, 0, 1, 1;
   1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1;
(End)

Cf. A098574, A000125, A055795, A027660, A055796, A002663.

Cf. A000325.

T:=(n,k)->binomial(n,k)+binomial(n,k+2): for n from 0 to 12 do seq(T(n,k),k=0..n) od; # yields sequence in triangular form

Flatten[Table[Binomial[n,k]+Binomial[n,k+2],{n,0,20},{k,0,n}]] (* Harvey P. Dale, Jun 12 2015 *)

T(n,k) = 3*T(n-1,k) + T(n-1,k-1) - 3*T(n-2,k) - 2*T(n-2,k-1) + T(n-3,k) + T(n-3,k-1), T(0,0) = T(1,0) = T(1,1) = T(2,2) = 1, T(2,0) = T(2,1) = 2, T(n,k) = 0 if k < 0 or if k > n. - Philippe Deléham, Feb 12 2014

Edited by N. J. A. Sloane, Nov 29 2006

A131251 A000012 * A052509.

Original entry on oeis.org

1, 2, 1, 3, 3, 1, 4, 6, 3, 1, 5, 10, 7, 3, 1, 6, 15, 14, 7, 3, 1, 7, 21, 25, 15, 7, 3, 1, 8, 28, 41, 30, 15, 7, 3, 1, 9, 36, 63, 56, 31, 15, 7, 3, 1, 10, 45, 92, 98, 62, 31, 15, 7, 3, 1

Offset: 0

Gary W. Adamson, Jun 23 2007

Row sums = A001924: (1, 3, 7, 14, 26, 46, 79, ...). A131252 = A052509 * A000012.
From Clark Kimberling, Feb 07 2011: (Start)
When formatted as a rectangle R with northwest corner
  1, 2, 3,  4,  5,  6, ...
  1, 3, 6, 10, 15, 21, ...
  1, 3, 7, 14, 25, 41, ...
  1, 3, 7, 15, 30, 56, ...
  1, 3, 7, 15, 31, 62, ...
  ...
the following properties hold:
R is the accumulation array of the transpose of A052553 (a version of Pascal's triangle); see A144112 for the definition of accumulation array.
row 1: A000027
row 2: A000217
row 3: A004006
row 4: A055795
row 5: A057703
row 6: A115567
limiting row:  A000225
antidiagonal sums: A001924.
(End)

			First few rows of the triangle:
  1;
  2,  1;
  3,  3,  1;
  4,  6,  3,  1;
  5, 10,  7,  3,  1;
  6, 15, 14,  7,  3,  1;
  7, 21, 25, 15,  7,  3,  1;
  ...

Cf. A052509, A000012, A001924, A131252.

A000012 * A052509 as infinite lower triangular matrices.

A136438 Hypertribonacci number array read by antidiagonals.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 2, 2, 0, 0, 1, 3, 4, 4, 0, 0, 1, 4, 7, 8, 7, 0, 0, 1, 5, 11, 15, 15, 13, 0, 0, 1, 6, 16, 26, 30, 28, 24, 0, 0, 1, 7, 22, 42, 56, 58, 52, 44, 0, 0, 1, 8, 29, 64, 98, 114, 110, 96, 81, 0, 0, 1, 9, 37, 93, 162, 212, 224, 206, 177, 149

Offset: 1

Jonathan Vos Post, Apr 13 2008

The hypertribonacci numbers are to the hyperfibonacci array of A136431 as the tribonacci numbers A000073 are to the Fibonacci numbers A000045.

			The array a(k,n) begins:
========================================
n=0..|.1.|.2.|...3.|..4.|...5.|....6.|...7..|.....8.|.....9.|....10.|
========================================
k=0..|.0.|.0.|...1.|..2.|...4.|....7.|..13..|....24.|....44.|....81.| A000073
k=1..|.0.|.0.|...2.|..4.|...8.|...15.|..28..|....52.|....96.|...177.| A008937
k=2..|.0.|.0.|...3.|..7.|..15.|...30.|..58..|...110.|...206.|...383.| A062544
k=3..|.0.|.0.|...4.|.11.|..26.|...56.|..114.|...224.|...430.|...813.|
k=4..|.0.|.0.|...5.|.16.|..42.|...98.|..212.|...436.|...866.|..1679.|
k=5..|.0.|.0.|...6.|.22.|..64.|..162.|..374.|...810.|..1676.|..3355.|
k=6..|.0.|.0.|...7.|.29.|..93.|..255.|..629.|..1439.|..3115.|..6470.|
k=7..|.0.|.0.|...8.|.37.|.130.|..385.|.1014.|..2453.|..5568.|.12038.|
k=8..|.0.|.0.|...9.|.46.|.176.|..561.|.1575.|..4028.|..9596.|.21634.|
k=9..|.0.|.0.|..10.|.56.|.232.|..793.|.2368.|..6396.|.15992.|.37626.|
k=10.|.0.|.0.|..11.|.67.|.299.|.1092.|.3460.|..9856.|.25848.|.63474.|
========================================

Columns n=4..6 are A000124, A000125, A055795.

Cf. A000045, A000073, A008937, A062544, A136431, A137176.

\\ create the n X n matrix of nonzero values
hypertribo(n)={ local(M=matrix(n,n)); M[1,]=Vec(1/(1-x-x^2-x^3)+O(x^n));
M[,1]=vector(n,i,1)~; for(i=2,n, for(j=2,n, M[i,j]=M[i-1,j]+M[i,j-1])); M}
{ hypertribo(10) }

a(k,n) = apply partial sum operator k times to tribonacci numbers A000073.

M. F. Hasler notes that the 8th column = vector(25,n,binomial(n+5,6)+binomial(n+5,4)+2*binomial(n+3,1)). R. J. Mathar points out that the repeated partial sums are quickly computed from their o.g.f.s (-1)^(k+1)*x^2/(-1+x+x^2+x^3)/(-1+x)^k, k=1,2,3,...

Examples corrected by R. J. Mathar, Apr 21 2008

cp's OEIS Frontend

A115567 a(n) = C(n,6) + C(n,5) + C(n,4) + C(n,3) + C(n,2) + C(n,1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Sage

Formula

A134394 Triangle T(n,k) = Sum_{j=k..n} A077028(j,k), read by rows.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Formula

A116082 a(n) = C(n,7) + C(n,6) + C(n,5) + C(n,4) + C(n,3) + C(n,2) + C(n,1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A124725 Triangle read by rows: T(n,k) = binomial(n,k) + binomial(n,k+2) (0 <= k <= n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A131251 A000012 * A052509.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A136438 Hypertribonacci number array read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula

Extensions