A000581 -id:A000581 - cp's OEIS frontend

A054333 1/256 of tenth unsigned column of triangle A053120 (T-Chebyshev, rising powers, zeros omitted).

1, 11, 65, 275, 935, 2717, 7007, 16445, 35750, 72930, 140998, 260338, 461890, 791350, 1314610, 2124694, 3350479, 5167525, 7811375, 11593725, 16921905, 24322155, 34467225, 48208875, 66615900, 91018356, 123058716, 164750740

Offset: 0

Barry E. Williams, Wolfdieter Lang, Mar 15 2000

If a 2-set Y and an (n-3)-set Z are disjoint subsets of an n-set X then a(n-10) is the number of 10-subsets of X intersecting both Y and Z. - Milan Janjic, Sep 08 2007
9-dimensional square numbers, eighth partial sums of binomial transform of [1,2,0,0,0,...]. a(n)=sum{i=0,n,C(n+8,i+8)*b(i)}, where b(i)=[1,2,0,0,0,...]. - Borislav St. Borisov (b.st.borisov(AT)abv.bg), Mar 05 2009
2*a(n) is number of ways to place 8 queens on an (n+8) X (n+8) chessboard so that they diagonally attack each other exactly 28 times. The maximal possible attack number, p=binomial(k,2) =28 for k=8 queens, is achievable only when all queens are on the same diagonal. In graph-theory representation they thus form the corresponding complete graph. - Antal Pinter, Dec 27 2015

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 795.
Albert H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 189, 194-196.
Theodore J. Rivlin, Chebyshev polynomials: from approximation theory to algebra and number theory, 2. ed., Wiley, New York, 1990.

G. C. Greubel, Table of n, a(n) for n = 0..5000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Milan Janjic, Two Enumerative Functions.
Feihu Liu, Guoce Xin, and Chen Zhang, Ehrhart Polynomials of Order Polytopes: Interpreting Combinatorial Sequences on the OEIS, arXiv:2412.18744 [math.CO], 2024. See p. 15.
Index entries for linear recurrences with constant coefficients, signature (10,-45,120,-210,252,-210,120,-45,10,-1).
Index entries for sequences related to Chebyshev polynomials.

Partial sums of A053347. Cf. A053120, A000581.
Cf. A005585, A040977, A050486, A053347. - Vladimir Joseph Stephan Orlovsky, Jan 15 2009
Cf. A111125, fifth column (s=4, without leading zeros). - Wolfdieter Lang, Oct 18 2012

List([0..30],n->(2*n+9)*Binomial(n+8,8)/9); # Muniru A Asiru, Dec 06 2018

[Binomial(n+8,8)+2*Binomial(n+8,9): n in [0..40]]; // Vincenzo Librandi, Feb 14 2016

LinearRecurrence[{10, -45, 120, -210, 252, -210, 120, -45, 10, -1}, {1, 11, 65, 275, 935, 2717, 7007, 16445, 35750, 72930}, 30] (* Vincenzo Librandi, Feb 14 2016 *)

vector(40, n, n--; (2*n+9)*binomial(n+8, 8)/9) \\ G. C. Greubel, Dec 02 2018

[(2*n+9)*binomial(n+8, 8)/9 for n in range(40)] # G. C. Greubel, Dec 02 2018

a(n) = (2*n+9)*binomial(n+8, 8)/9 = ((-1)^n)*A053120(2*n+9, 9)/2^8.
G.f.: (1+x)/(1-x)^10.
a(n) = 2*C(n+9, 9) - C(n+8, 8). - Paul Barry, Mar 04 2003
a(n) = C(n+8,8) + 2*C(n+8,9). - Borislav St. Borisov (b.st.borisov(AT)abv.bg), Mar 05 2009
E.g.f.: (1/362880)*exp(x)*(362880 + 3628800*x + 7983360*x^2 + 6773760*x^3 + 2751840*x^4 + 592704*x^5 + 70560*x^6 + 4608*x^7 + 153*x^8 + 2*x^9). - Stefano Spezia, Dec 03 2018
From Amiram Eldar, Jan 26 2022: (Start)
Sum_{n>=0} 1/a(n) = 294912*log(2)/35 - 7153248/1225.
Sum_{n>=0} (-1)^n/a(n) = 73728*Pi/35 - 8105688/1225. (End)

A010965 a(n) = binomial(n,12).

Original entry on oeis.org

1, 13, 91, 455, 1820, 6188, 18564, 50388, 125970, 293930, 646646, 1352078, 2704156, 5200300, 9657700, 17383860, 30421755, 51895935, 86493225, 141120525, 225792840, 354817320, 548354040, 834451800, 1251677700, 1852482996, 2707475148, 3910797436, 5586853480

Offset: 12

N. J. A. Sloane

nonn

Coordination sequence for 12-dimensional cyclotomic lattice Z[zeta_13].

In this sequence only 13 is prime. - Artur Jasinski, Dec 02 2007

T. D. Noe, Table of n, a(n) for n = 12..1000
Matthias Beck and Serkan Hosten, Cyclotomic polytopes and growth series of cyclotomic lattices, arXiv:math/0508136 [math.CO], 2005-2006.
Index entries for linear recurrences with constant coefficients, signature (13, -78, 286, -715, 1287, -1716, 1716, -1287, 715, -286, 78, -13, 1).

Cf. A000581, A010966, A010967, A001787, A242091.

[Binomial(n, 12): n in [12..100]]; // Vincenzo Librandi, Apr 22 2011

seq(binomial(n,12),n=12..36); # Zerinvary Lajos, Aug 06 2008

Table[Binomial[n,12],{n,12,50}] (* Vladimir Joseph Stephan Orlovsky, Apr 22 2011 *)

for(n=12, 50, print1(binomial(n,12), ", ")) \\ G. C. Greubel, Aug 31 2017

a(n) = A110555(n+1,12). - Reinhard Zumkeller, Jul 27 2005
a(n+11) = n(n+1)(n+2)(n+3)(n+4)(n+5)(n+6)(n+7)(n+8)(n+9)(n+10)(n+11)/12!. - Artur Jasinski, Dec 02 2007, R. J. Mathar, Jul 07 2009
G.f.: x^12/(1-x)^13. - Zerinvary Lajos, Aug 06 2008, R. J. Mathar, Jul 07 2009
From Amiram Eldar, Dec 10 2020: (Start)
Sum_{n>=12} 1/a(n) = 12/11.
Sum_{n>=12} (-1)^n/a(n) = A001787(12)*log(2) - A242091(12)/11! = 24576*log(2) - 3934820/231 = 0.9322955884... (End)

Some formulas referring to other offsets corrected by R. J. Mathar, Jul 07 2009

A010966 a(n) = binomial(n,13).

Original entry on oeis.org

1, 14, 105, 560, 2380, 8568, 27132, 77520, 203490, 497420, 1144066, 2496144, 5200300, 10400600, 20058300, 37442160, 67863915, 119759850, 206253075, 347373600, 573166440, 927983760, 1476337800, 2310789600, 3562467300, 5414950296, 8122425444, 12033222880

Offset: 13

N. J. A. Sloane

nonn

In this sequence there are no primes. - Artur Jasinski, Dec 02 2007

T. D. Noe, Table of n, a(n) for n = 13..1000
Milan Janjic, Two Enumerative Functions University of Banja Luka (Bosnia and Herzegovina, 2017).
Ângela Mestre and José Agapito, Square Matrices Generated by Sequences of Riordan Arrays, J. Int. Seq., Vol. 22 (2019), Article 19.8.4.
Index entries for linear recurrences with constant coefficients, signature (14,-91,364,-1001,2002,-3003,3432,-3003,2002,-1001,364,-91,14,-1).

Cf. A000581, A001787, A110555, A242091.

[ Binomial(n,13): n in [13..50]]; // Vincenzo Librandi, Mar 26 2011

seq(binomial(n,13),n=13..36); # Zerinvary Lajos, Aug 06 2008

Table[Binomial[n,13],{n,13,50}] (* Vladimir Joseph Stephan Orlovsky, Apr 22 2011 *)

for(n=13, 50, print1(binomial(n,13), ", ")) \\ G. C. Greubel, Aug 31 2017

a(n) = -A110555(n+1,13). - Reinhard Zumkeller, Jul 27 2005
a(n+12) = n(n+1)(n+2)(n+3)(n+4)(n+5)(n+6)(n+7)(n+8)(n+9)(n+10)(n+11)(n+12)/13!. - Artur Jasinski, Dec 02 2007; R. J. Mathar, Jul 07 2009
G.f.: x^13/(1-x)^14. - Zerinvary Lajos, Aug 06 2008
a(n) = n/(n-13) * a(n-1), n > 13. - Vincenzo Librandi, Mar 26 2011
From Amiram Eldar, Dec 10 2020: (Start)
Sum_{n>=13} 1/a(n) = 13/12.
Sum_{n>=13} (-1)^(n+1)/a(n) = A001787(13)*log(2) - A242091(13)/12! = 53248*log(2) - 102308323/2772 = 0.9366404415... (End)

Some formulas for different offsets rewritten by R. J. Mathar, Jul 07 2009

A242023 Decimal expansion of Sum_{n >= 1} (-1)^(n + 1)24/(n(n + 1)(n + 2)(n + 3)).

Original entry on oeis.org

8, 4, 7, 3, 7, 6, 4, 4, 4, 5, 8, 4, 9, 1, 6, 5, 6, 8, 0, 1, 8, 0, 9, 4, 5, 5, 3, 3, 2, 8, 3, 1, 6, 8, 4, 5, 0, 8, 2, 6, 7, 0, 9, 6, 6, 1, 9, 4, 8, 3, 4, 7, 9, 8, 5, 2, 8, 4, 2, 6, 9, 7, 0, 4, 5, 5, 2, 6, 2, 5, 6, 9, 6, 9

Offset: 0

Richard R. Forberg, Aug 11 2014

Sum of terms of the inverse of Binomial(n,4) or A000332, for n>=4, with alternating signs.
In general the sums of Binomial coefficients of this form appear to have the form  m*log(2) - r, where m is an integer and r is rational as below:
For Binomial(n,1):  m = 1, r = 0. See A002162.
For Binomial(n,2):  m = 4, r = 2. See A000217.
For Binomial(n,3):  m = 12 r = 15/2. See A000292.
For Binomial(n,4):  m = 32, r = 64/3. See A000332.
For Binomial(n,5):  m = 80, r = 655/12. See A000389.
For Binomial(n,6):  m = 192, r = 661/5. See A000579.
For Binomial(n,7):  m = 448, r = 9289/30. See A000580.
For Binomial(n,8):  m = 1024, r = 74432/105. See A000581.
This is generalized as follows:
m grows as A001787(k) = k*2^(k-1) for Binomial(n,k).
r * (k-1)! produces the integer sequence: a(k) = 0, 2, 15, 128, 1310, 15864, 222936, 3572736,  where a(k+1)/a(k) approaches 2*k for large k.
Results are precise to 100 digits or more using Mathematica.

			0.8473764445849165680180945...

G. C. Greubel, Table of n, a(n) for n = 0..5000

Cf. A000332, A000217, A000292, A242024, A002162, A001787.

[32*Log(2) - 64/3]; // G. C. Greubel, Nov 23 2017

Sum[N[(-1)^(n + 1)*24/(n*(n + 1)*(n + 2)*(n + 3)), 150], {n, 1, Infinity}]
RealDigits[32*Log[2] - 64/3, 10, 50][[1]] (* G. C. Greubel, Nov 23 2017 *)

32*log(2) - 64/3 \\ Michel Marcus, Aug 13 2014

sumalt(n=1, (-1)^(n + 1)*24/(n*(n + 1)*(n + 2)*(n + 3))) \\ Michel Marcus, Aug 14 2014

Equals 32*log(2) - 64/3.

Equals 32*(A259284-1). - R. J. Mathar, Jun 30 2021

A221857 Number A(n,k) of shapes of balanced k-ary trees with n nodes, where a tree is balanced if the total number of nodes in subtrees corresponding to the branches of any node differ by at most one; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 3, 1, 1, 0, 1, 1, 4, 3, 4, 1, 0, 1, 1, 5, 6, 1, 4, 1, 0, 1, 1, 6, 10, 4, 9, 4, 1, 0, 1, 1, 7, 15, 10, 1, 27, 1, 1, 0, 1, 1, 8, 21, 20, 5, 16, 27, 8, 1, 0, 1, 1, 9, 28, 35, 15, 1, 96, 81, 16, 1, 0, 1, 1, 10, 36, 56, 35, 6, 25, 256, 81, 32, 1, 0

Offset: 0

Alois P. Heinz, Apr 10 2013

			: A(2,2) = 2  : A(2,3) = 3      : A(3,3) = 3          :
:   o     o   :   o    o    o   :   o      o      o   :
:  / \   / \  :  /|\  /|\  /|\  :  /|\    /|\    /|\  :
: o         o : o      o      o : o o    o   o    o o :
:.............:.................:.....................:
: A(3,4) = 6                                          :
:    o        o        o        o       o        o    :
:  /( )\    /( )\    /( )\    /( )\   /( )\    /( )\  :
: o o      o   o    o     o    o o     o   o      o o :
Square array A(n,k) begins:
  1, 1, 1,  1,   1,   1,  1,  1,  1,   1,   1, ...
  1, 1, 1,  1,   1,   1,  1,  1,  1,   1,   1, ...
  0, 1, 2,  3,   4,   5,  6,  7,  8,   9,  10, ...
  0, 1, 1,  3,   6,  10, 15, 21, 28,  36,  45, ...
  0, 1, 4,  1,   4,  10, 20, 35, 56,  84, 120, ...
  0, 1, 4,  9,   1,   5, 15, 35, 70, 126, 210, ...
  0, 1, 4, 27,  16,   1,  6, 21, 56, 126, 252, ...
  0, 1, 1, 27,  96,  25,  1,  7, 28,  84, 210, ...
  0, 1, 8, 81, 256, 250, 36,  1,  8,  36, 120, ...

Alois P. Heinz, Antidiagonals n = 0..140, flattened
Jeffrey Barnett, Counting Balanced Tree Shapes, 2007
Samuele Giraudo, Intervals of balanced binary trees in the Tamari lattice, arXiv:1107.3472 [math.CO], Apr 2012

Columns k=1-10 give: A000012, A110316, A131889, A131890, A131891, A131892, A131893, A229393, A229394, A229395.
Rows n=0+1, 2-3, give: A000012, A001477, A179865.
Diagonal and upper diagonals give: A028310, A000217, A000292, A000332, A000389, A000579, A000580, A000581, A000582, A001287, A001288.
Lower diagonals give: A000012, A000290, A092364(n) for n>1.

A:= proc(n, k) option remember; local m, r; if n<2 or k=1 then 1
      elif k=0 then 0 else r:= iquo(n-1, k, 'm');
      binomial(k, m)*A(r+1, k)^m*A(r, k)^(k-m) fi
    end:
seq(seq(A(n, d-n), n=0..d), d=0..12);

a[n_, k_] := a[n, k] = Module[{m, r}, If[n < 2 || k == 1, 1, If[k == 0, 0, {r, m} = QuotientRemainder[n-1, k]; Binomial[k, m]*a[r+1, k]^m*a[r, k]^(k-m)]]]; Table[a[n, d-n], {d, 0, 12}, {n, 0, d}] // Flatten (* Jean-François Alcover, Apr 17 2013, translated from Maple *)

A254142 a(n) = (9n+10)binomial(n+9,9)/10.

Original entry on oeis.org

1, 19, 154, 814, 3289, 11011, 32032, 83512, 199342, 442442, 923780, 1830764, 3468374, 6317234, 11113784, 18958808, 31461815, 50930165, 80613390, 125014890, 190285095, 284712285, 419329560, 608658960, 871616460, 1232604516, 1722822024, 2381824984

Offset: 0

Bruno Berselli, Jan 26 2015

Partial sums of A056003.

If n is of the form 8*k+2*(-1)^k-1 or 8*k+2*(-1)^k-2 then a(n) is odd.

Bruno Berselli, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (11,-55,165,-330,462,-462,330,-165,55,-11,1).

Cf. A000581, A001287, A056003.

Cf. sequences of the type (k*n+k+1)*binomial(n+k,k)/(k+1): A000217 (k=1), A000330 (k=2), A001296 (k=3), A034263 (k=4), A051946 (k=5), A034265 (k=6), A034266 (k=7), A056122 (k=8), this sequence (k=9).

List([0..30], n-> (9*n+10)*Binomial(n+9,9)/10); # G. C. Greubel, Aug 28 2019

[(9*n+10)*Binomial(n+9,9)/10: n in [0..30]];

seq((9*n+10)*binomial(n+9,9)/10, n=0..30); # G. C. Greubel, Aug 28 2019

Table[(9n+10)Binomial[n+9, 9]/10, {n, 0, 30}]

vector(30, n, n--; (9*n+10)*binomial(n+9, 9)/10)

[(9*n+10)*binomial(n+9,9)/10 for n in (0..30)]

G.f.: (1 + 8*x)/(1-x)^11.
a(n) = Sum_{i=0..n} (i+1)*A000581(i+8).
a(n+1) = 8*A001287(n+10) + A001287(n+11).

A258993 Triangle read by rows: T(n,k) = binomial(n+k,n-k), k = 0..n-1.

Original entry on oeis.org

1, 1, 3, 1, 6, 5, 1, 10, 15, 7, 1, 15, 35, 28, 9, 1, 21, 70, 84, 45, 11, 1, 28, 126, 210, 165, 66, 13, 1, 36, 210, 462, 495, 286, 91, 15, 1, 45, 330, 924, 1287, 1001, 455, 120, 17, 1, 55, 495, 1716, 3003, 3003, 1820, 680, 153, 19, 1, 66, 715, 3003, 6435, 8008, 6188, 3060, 969, 190, 21

Offset: 1

Reinhard Zumkeller, Jun 22 2015

T(n,k) = A085478(n,k) = A007318(A094727(n),A004736(k)), k = 0..n-1;
rounded(T(n,k)/(2*k+1)) = A258708(n,k);
rounded(sum(T(n,k)/(2*k+1)): k = 0..n-1) = A000967(n).

			.  n\k |  0  1    2    3     4     5     6     7    8    9  10 11
. -----+-----------------------------------------------------------
.   1  |  1
.   2  |  1  3
.   3  |  1  6    5
.   4  |  1 10   15    7
.   5  |  1 15   35   28     9
.   6  |  1 21   70   84    45    11
.   7  |  1 28  126  210   165    66    13
.   8  |  1 36  210  462   495   286    91    15
.   9  |  1 45  330  924  1287  1001   455   120   17
.  10  |  1 55  495 1716  3003  3003  1820   680  153   19
.  11  |  1 66  715 3003  6435  8008  6188  3060  969  190  21
.  12  |  1 78 1001 5005 12870 19448 18564 11628 4845 1330 231 23  .

Reinhard Zumkeller, Rows n = 1..125 of triangle, flattened

If a diagonal of 1's is added on the right, this becomes A085478.
Essentially the same as A143858.
Cf. A007318, A004736, A094727.
Cf. A027941 (row sums), A117671 (central terms), A143858, A000967, A258708.
T(n,k): A000217 (k=1), A000332 (k=2), A000579 (k=3), A000581 (k=4), A001287 (k=5), A010965 (k=6), A010967 (k=7), A010969 (k=8), A010971 (k=9), A010973 (k=10), A010975 (k=11), A010977 (k=12), A010979 (k=13), A010981 (k=14), A010983 (k=15), A010985 (k=16), A010987 (k=17), A010989 (k=18), A010991 (k=19), A010993 (k=20), A010995 (k=21), A010997 (k=22), A010999 (k=23), A011001 (k=24), A017714 (k=25), A017716 (k=26), A017718 (k=27), A017720 (k=28), A017722 (k=29), A017724 (k=30), A017726 (k=31), A017728 (k=32), A017730 (k=33), A017732 (k=34), A017734 (k=35), A017736 (k=36), A017738 (k=37), A017740 (k=38), A017742 (k=39), A017744 (k=40), A017746 (k=41), A017748 (k=42), A017750 (k=43), A017752 (k=44), A017754 (k=45), A017756 (k=46), A017758 (k=47), A017760 (k=48), A017762 (k=49), A017764 (k=50).
T(n+k,n): A005408 (k=1), A000384 (k=2), A000447 (k=3), A053134 (k=4), A002299 (k=5), A053135 (k=6), A053136 (k=7), A053137 (k=8), A053138 (k=9), A196789 (k=10).
Cf. A165253.

Flat(List([1..12], n-> List([0..n-1], k-> Binomial(n+k,n-k) ))); # G. C. Greubel, Aug 01 2019

a258993 n k = a258993_tabl !! (n-1) !! k
a258993_row n = a258993_tabl !! (n-1)
a258993_tabl = zipWith (zipWith a007318) a094727_tabl a004736_tabl

[Binomial(n+k,n-k): k in [0..n-1], n in [1..12]]; // G. C. Greubel, Aug 01 2019

Table[Binomial[n+k,n-k], {n,1,12}, {k,0,n-1}]//Flatten (* G. C. Greubel, Aug 01 2019 *)

T(n,k) = binomial(n+k,n-k);
for(n=1, 12, for(k=0,n-1, print1(T(n,k), ", "))) \\ G. C. Greubel, Aug 01 2019

[[binomial(n+k,n-k) for k in (0..n-1)] for n in (1..12)] # G. C. Greubel, Aug 01 2019

T(n,k) = A085478(n,k) = A007318(A094727(n),A004736(k)), k = 0..n-1;
rounded(T(n,k)/(2*k+1)) = A258708(n,k);
rounded(sum(T(n,k)/(2*k+1)): k = 0..n-1) = A000967(n).

A101104 a(1)=1, a(2)=12, a(3)=23, and a(n)=24 for n>=4.

Original entry on oeis.org

1, 12, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24

Offset: 1

Cecilia Rossiter, Dec 15 2004

Original name: The first summation of row 4 of Euler's triangle - a row that will recursively accumulate to the power of 4.

D. J. Pengelley, The bridge between the continuous and the discrete via original sources in Study the Masters: The Abel-Fauvel Conference [pdf], Kristiansand, 2002, (ed. Otto Bekken et al), National Center for Mathematics Education, University of Gothenburg, Sweden, in press.
C. Rossiter, Depictions, Explorations and Formulas of the Euler/Pascal Cube [Dead link]
C. Rossiter, Depictions, Explorations and Formulas of the Euler/Pascal Cube [Cached copy, May 15 2013]
Eric Weisstein, Link to section of MathWorld: Worpitzky's Identity of 1883
Eric Weisstein, Link to section of MathWorld: Eulerian Number
Eric Weisstein, Link to section of MathWorld: Nexus number
Eric Weisstein, Link to section of MathWorld: Finite Differences
Index entries for linear recurrences with constant coefficients, signature (1).

For other sequences based upon MagicNKZ(n,k,z):
..... |  n = 1  |  n = 2  |  n = 3  |  n = 4  |  n = 5  |  n = 6  |  n = 7
---------------------------------------------------------------------------
z = 0 | A000007 | A019590 | .......MagicNKZ(n,k,0) = A008292(n,k+1) .......
z = 1 | A000012 | A040000 | A101101 | thisSeq | A101100 | ....... | .......
z = 2 | A000027 | A005408 | A008458 | A101103 | A101095 | ....... | .......
z = 3 | A000217 | A000290 | A003215 | A005914 | A101096 | ....... | .......
z = 4 | A000292 | A000330 | A000578 | A005917 | A101098 | ....... | .......
z = 5 | A000332 | A002415 | A000537 | A000583 | A022521 | ....... | A255181
z = 6 | A000389 | A005585 | A024166 | A000538 | A000584 | A022522 | A255177
z = 7 | A000579 | A040977 | A101094 | A101089 | A000539 | A001014 | A022523
z = 8 | A000580 | A050486 | A101097 | A101090 | A101092 | A000540 | A001015
z = 9 | A000581 | A053347 | A101102 | A101091 | A101099 | A101093 | A000541
Cf. A101095 for an expanded table and more about MagicNKZ.

MagicNKZ = Sum[(-1)^j*Binomial[n+1-z, j]*(k-j+1)^n, {j, 0, k+1}];Table[MagicNKZ, {n, 4, 4}, {z, 1, 1}, {k, 0, 34}]
Join[{1, 12, 23},LinearRecurrence[{1},{24},56]] (* Ray Chandler, Sep 23 2015 *)

a(k) = MagicNKZ(4,k,1) where MagicNKZ(n,k,z) = Sum_{j=0..k+1} (-1)^j*binomial(n+1-z,j)*(k-j+1)^n (cf. A101095). That is, a(k) = Sum_{j=0..k+1} (-1)^j*binomial(4, j)*(k-j+1)^4.
a(1)=1, a(2)=12, a(3)=23, and a(n)=24 for n>=4. - Joerg Arndt, Nov 30 2014
G.f.: x*(1+11*x+11*x^2+x^3)/(1-x). - Colin Barker, Apr 16 2012

New name from Joerg Arndt, Nov 30 2014

Original Formula edited and Crossrefs table added by Danny Rorabaugh, Apr 22 2015

A010967 a(n) = binomial coefficient C(n,14).

Original entry on oeis.org

1, 15, 120, 680, 3060, 11628, 38760, 116280, 319770, 817190, 1961256, 4457400, 9657700, 20058300, 40116600, 77558760, 145422675, 265182525, 471435600, 818809200, 1391975640, 2319959400, 3796297200, 6107086800, 9669554100, 15084504396, 23206929840, 35240152720

Offset: 14

N. J. A. Sloane

nonn

In this sequence there are no primes. - Artur Jasinski, Dec 02 2007

T. D. Noe, Table of n, a(n) for n = 14..1000
Milan Janjic, Two Enumerative Functions.
Index entries for linear recurrences with constant coefficients, signature (15, -105, 455, -1365, 3003, -5005, 6435, -6435, 5005, -3003, 1365, -455, 105, -15, 1).

Cf. A000581, A001787, A110555, A242091.

[ Binomial(n,14): n in [14..60]]; // Vincenzo Librandi, Mar 26 2011

seq(binomial(n,14),n=14..37); # Zerinvary Lajos, Aug 06 2008

Table[Binomial[n,14],{n,14,50}] (* Vladimir Joseph Stephan Orlovsky, Apr 22 2011 *)

for(n=14, 50, print1(binomial(n,14), ", ")) \\ G. C. Greubel, Aug 31 2017

a(n) = A110555(n+1,14). - Reinhard Zumkeller, Jul 27 2005
a(n+13) = n(n+1)(n+2)(n+3)(n+4)(n+5)(n+6)(n+7)(n+8)(n+9)(n+10)(n+11)(n+12)(n+13)/14!. - Artur Jasinski, Dec 02 2007, R. J. Mathar, Jul 07 2009
G.f.: x^14/(1-x)^15. - Zerinvary Lajos, Aug 06 2008, R. J. Mathar, Jul 07 2009
a(n) = n/(n-14) * a(n-1), n > 14. - Vincenzo Librandi, Mar 26 2011
From Amiram Eldar, Dec 10 2020: (Start)
Sum_{n>=14} 1/a(n) = 14/13.
Sum_{n>=14} (-1)^n/a(n) = A001787(14)*log(2) - A242091(14)/13! = 114688*log(2) - 102309709/1287 = 0.9404563356... (End)

Some formulas rewritten for the correct offset by R. J. Mathar, Jul 07 2009

A001780 Expansion of 1/((1+x)(1-x)^9).

Original entry on oeis.org

1, 8, 37, 128, 367, 920, 2083, 4352, 8518, 15792, 27966, 47616, 78354, 125136, 194634, 295680, 439791, 641784, 920491, 1299584, 1808521, 2483624, 3369301, 4519424, 5998876, 7885280, 10270924, 13264896

Offset: 0

N. J. A. Sloane

Vincenzo Librandi, Table of n, a(n) for n = 0..2000
Jia Huang, Partially Palindromic Compositions, J. Int. Seq. (2023) Vol. 26, Art. 23.4.1. See pp. 4, 17.
Index entries for linear recurrences with constant coefficients, signature (8,-27,48,-42,0,42,-48,27,-8,1).

Cf. A001769, A158454 (signed column k=4), A001779 (first differences), A169796 (binomial trans.).

Vec(1/(1+x)/(1-x)^9+O(x^99)) \\ Charles R Greathouse IV, Apr 18 2012

a(n) = 431*n/168 + (-1)^n/512 + 391*n^3/288 + 26011*n^2/10080 + 797*n^4/1920 + 11*n^5/144 + n^6/120 + n^7/2016 + n^8/80640 + 511/512. - R. J. Mathar, Mar 15 2011
Boas-Buck recurrence: a(n) = (1/n)*Sum_{p=0..n-1} (9 + (-1)^(n-p))*a(p), n >= 1, a(0) = 1. See the Boas-Buck comment in A046521 (here for the unsigned column k = 4 with offset 0). - Wolfdieter Lang, Aug 10 2017
a(n)+a(n+1) = A000581(n+9) . - R. J. Mathar, Jan 06 2021

cp's OEIS Frontend

A054333 1/256 of tenth unsigned column of triangle A053120 (T-Chebyshev, rising powers, zeros omitted).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

A010965 a(n) = binomial(n,12).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A010966 a(n) = binomial(n,13).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A242023 Decimal expansion of Sum_{n >= 1} (-1)^(n + 1)*24/(n*(n + 1)*(n + 2)*(n + 3)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

A221857 Number A(n,k) of shapes of balanced k-ary trees with n nodes, where a tree is balanced if the total number of nodes in subtrees corresponding to the branches of any node differ by at most one; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A254142 a(n) = (9*n+10)*binomial(n+9,9)/10.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

A242023 Decimal expansion of Sum_{n >= 1} (-1)^(n + 1)24/(n(n + 1)(n + 2)(n + 3)).

A254142 a(n) = (9n+10)binomial(n+9,9)/10.