A034839 -id:A034839 - cp's OEIS frontend

A382472 a(n) = Sum_{k=0..n} binomial(k+5,5) * binomial(2k,2n-2*k).

1, 6, 27, 182, 987, 4620, 20678, 87732, 355095, 1387462, 5258967, 19416222, 70086803, 248046540, 862694058, 2954279732, 9977518122, 33278815920, 109749059308, 358231786128, 1158357919194, 3713416860580, 11810098024410, 37285901203740, 116917784689237

Offset: 0

Seiichi Manyama, Mar 28 2025

Vincenzo Librandi, Table of n, a(n) for n = 0..500
Index entries for linear recurrences with constant coefficients, signature (12,-54,112,-141,312,-674,588,-714,1812,-1134,888,-2741,888,-1134,1812,-714,588,-674,312,-141,112,-54,12,-1).

Cf. A108479, A381421, A382230, A382470, A382471, A382473, A382474.

Cf. A034839, A377153.

[&+[Binomial(k+5, 5) * Binomial(2*k, 2*n-2*k): k in [0..n]]: n in [0..25]]; // Vincenzo Librandi, Apr 11 2025

Table[Sum[Binomial[k+5,5]*Binomial[2*k,2*n-2*k],{k,0,n}],{n,0,30}] (* Vincenzo Librandi, Apr 11 2025 *)

a(n) = sum(k=0, n, binomial(k+5, 5)*binomial(2*k, 2*n-2*k));

my(N=5, M=30, x='x+O('x^M), X=1-x-x^2, Y=3); Vec(sum(k=0, (N+1)\2, 4^k*binomial(N+1, 2*k)*X^(N+1-2*k)*x^(Y*k))/(X^2-4*x^Y)^(N+1))

G.f.: (Sum_{k=0..3} 4^k * binomial(6,2*k) * (1-x-x^2)^(6-2*k) * x^(3*k)) / ((1-x-x^2)^2 - 4*x^3)^6.

A382473 a(n) = Sum_{k=0..n} binomial(k+6,6) * binomial(2k,2n-2*k).

Original entry on oeis.org

1, 7, 35, 252, 1498, 7602, 36498, 165600, 713769, 2957647, 11850223, 46111352, 174956250, 649284286, 2362771938, 8449241836, 29744151416, 103237104740, 353744829032, 1198001464940, 4013905507150, 13316690882670, 43780154987030, 142726581203640

Offset: 0

Seiichi Manyama, Mar 28 2025

Vincenzo Librandi, Table of n, a(n) for n = 0..500
Index entries for linear recurrences with constant coefficients, signature (14, -77, 210, -336, 602, -1435, 2018, -1981, 4312, -5894, 3360, -7721, 9562, -3079, 9562, -7721, 3360, -5894, 4312, -1981, 2018, -1435, 602, -336, 210, -77, 14, -1).

Cf. A108479, A381421, A382230, A382470, A382471, A382472, A382474.

Cf. A034839, A377158.

[&+[Binomial(k+6, 6) * Binomial(2*k, 2*n-2*k): k in [0..n]]: n in [0..25]]; // Vincenzo Librandi, Apr 11 2025

Table[Sum[Binomial[k+6,6]*Binomial[2*k,2*n-2*k],{k,0,n}],{n,0,30}] (* Vincenzo Librandi, Apr 11 2025 *)

a(n) = sum(k=0, n, binomial(k+6, 6)*binomial(2*k, 2*n-2*k));

my(N=6, M=30, x='x+O('x^M), X=1-x-x^2, Y=3); Vec(sum(k=0, (N+1)\2, 4^k*binomial(N+1, 2*k)*X^(N+1-2*k)*x^(Y*k))/(X^2-4*x^Y)^(N+1))

G.f.: (Sum_{k=0..3} 4^k * binomial(7,2*k) * (1-x-x^2)^(7-2*k) * x^(3*k)) / ((1-x-x^2)^2 - 4*x^3)^7.

A382474 a(n) = Sum_{k=0..n} binomial(k+7,7) * binomial(2k,2n-2*k).

Original entry on oeis.org

1, 8, 44, 336, 2166, 11832, 60576, 292248, 1334817, 5840296, 24637976, 100684376, 400255050, 1553016960, 5897388492, 21967711160, 80425346844, 289868771928, 1029979010972, 3612517052608, 12520285820362, 42919328903928, 145643017892472, 489606988741128

Offset: 0

Seiichi Manyama, Mar 28 2025

Vincenzo Librandi, Table of n, a(n) for n = 0..500
Index entries for linear recurrences with constant coefficients, signature (16, -104, 352, -708, 1232, -2800, 5168, -6122, 9728, -18008, 16816, -19152, 37744, -27096, 24960, -50611, 24960, -27096, 37744, -19152, 16816, -18008, 9728, -6122, 5168, -2800, 1232, -708, 352, -104, 16, -1).

Cf. A108479, A381421, A382230, A382470, A382471, A382472, A382473.

Cf. A034839, A377159.

[&+[Binomial(k+7, 7) * Binomial(2*k, 2*n-2*k): k in [0..n]]: n in [0..29]]; // Vincenzo Librandi, Apr 22 2025

Table[Sum[Binomial[k+7,7]*Binomial[2*k,2*n-2*k],{k,0,n}],{n,0,30}] (* Vincenzo Librandi, Apr 22 2025 *)

a(n) = sum(k=0, n, binomial(k+7, 7)*binomial(2*k, 2*n-2*k));

my(N=7, M=30, x='x+O('x^M), X=1-x-x^2, Y=3); Vec(sum(k=0, (N+1)\2, 4^k*binomial(N+1, 2*k)*X^(N+1-2*k)*x^(Y*k))/(X^2-4*x^Y)^(N+1))

G.f.: (Sum_{k=0..4} 4^k * binomial(8,2*k) * (1-x-x^2)^(8-2*k) * x^(3*k)) / ((1-x-x^2)^2 - 4*x^3)^8.

A245564 a(n) = Product_{i in row n of A245562} Fibonacci(i+2).

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 3, 5, 2, 4, 4, 6, 3, 6, 5, 8, 2, 4, 4, 6, 4, 8, 6, 10, 3, 6, 6, 9, 5, 10, 8, 13, 2, 4, 4, 6, 4, 8, 6, 10, 4, 8, 8, 12, 6, 12, 10, 16, 3, 6, 6, 9, 6, 12, 9, 15, 5, 10, 10, 15, 8, 16, 13, 21, 2, 4, 4, 6, 4, 8, 6, 10, 4, 8, 8, 12, 6, 12, 10, 16, 4, 8, 8, 12, 8, 16, 12, 20, 6, 12, 12, 18

Offset: 0

N. J. A. Sloane, Aug 10 2014; revised Sep 05 2014

This is the Run Length Transform of S(n) = Fibonacci(n+2).
The Run Length Transform of a sequence {S(n), n>=0} is defined to be the sequence {T(n), n>=0} given by T(n) = Product_i S(i), where i runs through the lengths of runs of 1's in the binary expansion of n. E.g. 19 is 10011 in binary, which has two runs of 1's, of lengths 1 and 2. So T(19) = S(1)*S(2). T(0)=1 (the empty product).
Also the number of sparse subsets of the binary indices of n, where a set is sparse iff 1 is not a first difference. The maximal case is A384883. For prime instead of binary indices we have A166469. - Gus Wiseman, Jul 05 2025

			From _Gus Wiseman_, Jul 05 2025: (Start)
The binary indices of 11 are {1,2,4}, with sparse subsets {{},{1},{2},{4},{1,4},{2,4}}, so a(11) = 6.
The maximal runs of binary indices of 11 are ((1,2),(4)), with lengths (2,1), so a(11) = F(2+2)*F(1+2) = 6.
The a(0) = 1 through a(12) = 3 sparse subsets are:
  0    1    2    3    4    5    6    7    8    9    10    11    12
  ------------------------------------------------------------------
  {}   {}   {}   {}   {}   {}   {}   {}   {}   {}    {}    {}    {}
       {1}  {2}  {1}  {3}  {1}  {2}  {1}  {4}  {1}   {2}   {1}   {3}
                 {2}       {3}  {3}  {2}       {4}   {4}   {2}   {4}
                           {1,3}     {3}       {1,4} {2,4} {4}
                                     {1,3}                 {1,4}
                                                           {2,4}
The greatest number whose set of binary indices is a member of column n above is A374356(n).
(End)

Alois P. Heinz, Table of n, a(n) for n = 0..8191
Chai Wah Wu, Sums of products of binomial coefficients mod 2 and run length transforms of sequences, arXiv:1610.06166 [math.CO], 2016.

Cf. A245562, A000045, A001045, A071053, A245565, A246028.
A034839 counts subsets by number of maximal runs, strict partitions A116674.
A384877 gives lengths of maximal anti-runs of binary indices, firsts A384878.
A384893 counts subsets by number of maximal anti-runs, for partitions A268193, A384905.
Cf. A000071, A001629, A010049, A053538, A166469, A202023, A202064, A208342, A374356, A384883.

with(combinat); ans:=[];
for n from 0 to 100 do lis:=[]; t1:=convert(n,base,2); L1:=nops(t1); out1:=1; c:=0;
for i from 1 to L1 do
   if out1 = 1 and t1[i] = 1 then out1:=0; c:=c+1;
   elif out1 = 0 and t1[i] = 1 then c:=c+1;
   elif out1 = 1 and t1[i] = 0 then c:=c;
   elif out1 = 0 and t1[i] = 0 then lis:=[c,op(lis)]; out1:=1; c:=0;
   fi;
   if i = L1 and c>0 then lis:=[c,op(lis)]; fi;
                   od:
a:=mul(fibonacci(i+2), i in lis);
ans:=[op(ans),a];
od:
ans;

a[n_] := Sum[Mod[Binomial[3k, k] Binomial[n, k], 2], {k, 0, n}];
a /@ Range[0, 100] (* Jean-François Alcover, Feb 29 2020, after Chai Wah Wu *)
spars[S_]:=Select[Subsets[S],FreeQ[Differences[#],1]&];
bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Table[Length[spars[bpe[n]]],{n,0,30}] (* Gus Wiseman, Jul 05 2025 *)

a(n)=my(s=1,k); while(n, n>>=valuation(n,2); k=valuation(n+1,2); s*=fibonacci(k+2); n>>=k); s \\ Charles R Greathouse IV, Oct 21 2016

# use RLT function from A278159
from sympy import fibonacci
def A245564(n): return RLT(n,lambda m: fibonacci(m+2)) # Chai Wah Wu, Feb 04 2022

a(n) = Sum_{k=0..n} ({binomial(3k,k)*binomial(n,k)} mod 2). - Chai Wah Wu, Oct 19 2016

A384891 Number of permutations of {1..n} with all distinct lengths of maximal runs (increasing by 1).

Original entry on oeis.org

1, 1, 1, 3, 3, 5, 23, 25, 43, 63, 345, 365, 665, 949, 1513, 8175, 9003, 15929, 23399, 36949, 51043, 293715, 314697, 570353, 826817, 1318201, 1810393, 2766099, 14180139, 15600413, 27707879, 40501321, 63981955, 88599903, 134362569, 181491125, 923029217

Offset: 0

Gus Wiseman, Jun 19 2025

nonn

			The permutation (1,2,6,7,8,9,3,4,5) has maximal runs ((1,2),(6,7,8,9),(3,4,5)), with lengths (2,4,3), so is counted under a(9).
The a(0) = 1 through a(7) = 25 permutations:
  ()  (1)  (12)  (123)  (1234)  (12345)  (123456)  (1234567)
                 (231)  (2341)  (23451)  (123564)  (1234675)
                 (312)  (4123)  (34512)  (123645)  (1234756)
                                (45123)  (124563)  (1245673)
                                (51234)  (126345)  (1273456)
                                         (145623)  (1456723)
                                         (156234)  (1672345)
                                         (231456)  (2314567)
                                         (234156)  (2345167)
                                         (234561)  (2345671)
                                         (312456)  (3124567)
                                         (345126)  (3456127)
                                         (345612)  (3456712)
                                         (412356)  (4567123)
                                         (451236)  (4567231)
                                         (456231)  (4567312)
                                         (456312)  (5123467)
                                         (561234)  (5612347)
                                         (562341)  (5671234)
                                         (564123)  (6712345)
                                         (612345)  (6723451)
                                         (634512)  (6751234)
                                         (645123)  (7123456)
                                                   (7345612)
                                                   (7561234)

Christian Sievers, Table of n, a(n) for n = 0..5000

Counting by number of maximal anti-runs gives A010027, for runs A123513.
For subsets instead of permutations we have A384175, complement A384176.
For partitions we have A384884 (anti-runs A384885), strict A384178 (anti-runs A384880).
For equal instead of distinct lengths we have A384892.
For anti-runs instead of runs we have A384907.
A000041 counts integer partitions, strict A000009.
A034839 counts subsets by number of maximal runs, for strict partitions A116674.
A098859 counts Wilf partitions (distinct multiplicities), complement A336866.
A356606 counts strict partitions without a neighborless part, complement A356607.
A384893 counts subsets by number of maximal anti-runs, for partitions A268193, A384905.
Cf. A000255, A044813, A072574, A242882, A287170, A325324, A325325, A328592, A329739, A351202, A384177, A384886.

Table[Length[Select[Permutations[Range[n]],UnsameQ@@Length/@Split[#,#2==#1+1&]&]],{n,0,10}]

lista(n)=my(b(n)=sum(i=0,n-1,(-1)^i*(n-i)!*binomial(n-1,i)), d=floor(sqrt(2*n)), p=prod(i=1,n,1+x*y^i,1+O(y*y^n)*((1-x^(n+1))/(1-x))+O(x*x^d))); Vec(1+sum(i=1,d,i!*b(i)*polcoef(p,i))) \\ Christian Sievers, Jun 22 2025

a(n) = Sum_{k=1..n} ( T(n,k) * A000255(k-1) ) for n>=1, where T(n,k) is the number of compositions of n into k distinct parts (cf. A072574). - Christian Sievers, Jun 22 2025

a(11) and beyond from Christian Sievers, Jun 22 2025

A384892 Number of permutations of {1..n} with all equal lengths of maximal runs (increasing by 1).

Original entry on oeis.org

1, 1, 2, 4, 13, 54, 314, 2120, 16700, 148333, 1468512, 16019532, 190899736, 2467007774, 34361896102, 513137616840, 8178130784179, 138547156531410, 2486151753462260, 47106033220679060, 939765362754015750, 19690321886243848784, 432292066866187743954

Offset: 0

Gus Wiseman, Jun 19 2025

nonn

			The permutation (1,2,5,6,3,4,7,8) has maximal runs ((1,2),(5,6),(3,4),(7,8)), with lengths (2,2,2,2), so is counted under a(8).
The a(0) = 1 through a(4) = 13 permutations:
  ()  (1)  (12)  (123)  (1234)
           (21)  (132)  (1324)
                 (213)  (1432)
                 (321)  (2143)
                        (2413)
                        (2431)
                        (3142)
                        (3214)
                        (3241)
                        (3412)
                        (4132)
                        (4213)
                        (4321)

Christian Sievers, Table of n, a(n) for n = 0..450

For subsets instead of permutations we have A243815, for anti-runs A384889.
For strict partitions and distinct lengths we have A384178, anti-runs A384880.
For integer partitions and distinct lengths we have A384884, anti-runs A384885.
For distinct lengths we have A384891, for anti-runs A384907.
For partitions we have A384904, strict A384886.
A010027 counts permutations by maximal anti-runs, for runs A123513.
A034839 counts subsets by number of maximal runs, for strict partitions A116674.
A098859 counts Wilf partitions (distinct multiplicities), complement A336866.
A384893 counts subsets by number of maximal anti-runs, for partitions A268193, A384905.
Cf. A000255, A044813, A047993, A242882, A325325, A329739, A351202, A384175, A384176, A384177.

Table[Length[Select[Permutations[Range[n]],SameQ@@Length/@Split[#,#2==#1+1&]&]],{n,0,10}]

a(n)=if(n,sumdiv(n,d,sum(i=0,d-1,(-1)^i*(d-i)!*binomial(d-1,i))),1) \\ Christian Sievers, Jun 22 2025

a(n) = Sum_{d|n} A000255(d-1). - Christian Sievers, Jun 22 2025

a(11) and beyond from Christian Sievers, Jun 22 2025

A062136 Twelfth column of Losanitsch's triangle A034851 (formatted as lower triangular matrix).

Original entry on oeis.org

1, 6, 42, 182, 693, 2184, 6216, 15912, 37854, 83980, 176484, 352716, 676270, 1248072, 2229096, 3863080, 6519591, 10737090, 17299646, 27313650, 42337659, 64512240, 96770544, 143048880, 208616044, 300402648, 427500360, 601661144, 838033836, 1155900720, 1579738736

Offset: 0

Wolfdieter Lang, Jun 19 2001

Also seventh column (m=6) of triangle A062135.

Number of homeomorphically irreducible (or series-reduced) trees (no vertices of degree 2) with n+9 leaves which become tree P(7) (path on 7 nodes (vertices) or 6 edges (links) when all leaves are omitted. A leave is an edge together with a node of degree 1 at one end). Proof by Polya enumeration. See illustration for A034851.

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for sequences related to trees

Cf. A018213.

[(1/(2*Factorial(11)))*(n + 1)*(n + 2)*(n + 3)*(n + 4)*(n + 5)*(n + 6)*(n + 7)*(n + 8)*(n + 9)*(n + 10)*(n + 11) + (1/15)*(1/2^9)*(n + 2)*(n + 4)*(n + 6)*(n + 8)*(n + 10)*(1/2)*(1 + (-1)^n): n in [0..30]]; // G. C. Greubel, Nov 24 2017

Table[(1/(2*11!))*(n + 1)*(n + 2)*(n + 3)*(n + 4)*(n + 5)*(n + 6)*(n + 7)*(n + 8)*(n + 9)*(n + 10)*(n + 11) + (1/15)*(1/2^9)*(n + 2)*(n + 4)*(n + 6)*(n + 8)*(n + 10)*(1/2)*(1 + (-1)^n), {n, 0, 50}] (* G. C. Greubel, Nov 24 2017 *)

for(n=0,50, print1((1/(2*11!))*(n + 1)*(n + 2)*(n + 3)*(n + 4)*(n + 5)*(n + 6)*(n + 7)*(n + 8)*(n + 9)*(n + 10)*(n + 11) + (1/15)*(1/2^9)*(n + 2)*(n + 4)*(n + 6)*(n + 8)*(n + 10)*(1/2)*(1 + (-1)^n), ", ")) \\ G. C. Greubel, Nov 24 2017

G.f.: Pe(6, x^2)/((1-x)^(2*6)*(1+x)^6), with Pe(6, x^2) := Sum_{m=0..3} A034839(6, m)*x^(2*m) = 1+15*x^2+15*x^4+x^6.
a(n) = A034851(n+11,11).
a(2n+1) = A001288(2n+12)/2; a(2n) = (A001288(2n+11)+A000389(n+5))/2. - Gary W. Adamson, Dec 15 2010
a(n) = (1/(2*11!))*(n+1)*(n+2)*(n+3)*(n+4)*(n+5)*(n+6)*(n+7)*(n+8)*(n+9)*(n+10)*(n+11) + (1/15)*(1/2^9)*(n+2)*(n+4)*(n+6)*(n+8)*(n+10)*(1/2)*(1+(-1)^n). - Yosu Yurramendi, Jun 24 2013

A176230 Exponential Riordan array [1/sqrt(1-2x), x/(1-2x)].

Original entry on oeis.org

1, 1, 1, 3, 6, 1, 15, 45, 15, 1, 105, 420, 210, 28, 1, 945, 4725, 3150, 630, 45, 1, 10395, 62370, 51975, 13860, 1485, 66, 1, 135135, 945945, 945945, 315315, 45045, 3003, 91, 1, 2027025, 16216200, 18918900, 7567560, 1351350, 120120, 5460, 120, 1, 34459425

Offset: 0

Paul Barry, Apr 12 2010

Row sums are A066223. Reverse of A119743. Inverse is alternating sign version.
Diagonal sums are essentially A025164.
From Tom Copeland, Dec 13 2015: (Start)
See A099174 for relations to the Hermite polynomials and the link for operator relations, including the infinitesimal generator containing A000384.
Row polynomials are 2^n n! Lag(n,-x/2,-1/2), where Lag(n,x,q) is the associated Laguerre polynomial of order q.
The triangles of Bessel numbers entries A122848, A049403, A096713, A104556 contain these polynomials as even or odd rows. Also the aerated version A099174 and A066325. Reversed, these entries are A100861, A144299, A111924.
Divided along the diagonals by the initial element (A001147) of the diagonal, this matrix becomes the even rows of A034839.
(End)
The first few rows appear in expansions related to the Dedekind eta function on pp. 537-538 of the Chan et al. link. - Tom Copeland, Dec 14 2016

			Triangle begins
        1,
        1,        1,
        3,        6,        1,
       15,       45,       15,       1,
      105,      420,      210,      28,       1,
      945,     4725,     3150,     630,      45,      1,
    10395,    62370,    51975,   13860,    1485,     66,    1,
   135135,   945945,   945945,  315315,   45045,   3003,   91,   1,
  2027025, 16216200, 18918900, 7567560, 1351350, 120120, 5460, 120, 1
Production matrix is
  1,  1,
  2,  5,  1,
  0, 12,  9,  1,
  0,  0, 30, 13,  1,
  0,  0,  0, 56, 17,   1,
  0,  0,  0,  0, 90,  21,   1,
  0,  0,  0,  0,  0, 132,  25,   1,
  0,  0,  0,  0,  0,   0, 182,  29,  1,
  0,  0,  0,  0,  0,   0,   0, 240, 33, 1.

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened
Peter Bala, Generalized Dobinski formulas
H. Chan, S. Cooper, and P. Toh, The 26th power of Dedekind's eta function Advances in Mathematics, 207 (2006) 532-543.
Tom Copeland, Infinitesimal Generators, the Pascal Pyramid, and the Witt and Virasoro Algebras, 2012.
Tom Copeland, Juggling Zeros in the Matrix (Example II), 2020.

Cf. A113278.

Cf. A000384, A001147, A034839, A049403, A066325, A096713, A099174, A100861, A104556, A111924, A122848, A144299.

ser := n -> series(KummerU(-n, 1/2, x), x, n+1):
seq(seq((-2)^(n-k)*coeff(ser(n), x, k), k=0..n), n=0..8); # Peter Luschny, Jan 18 2020

t[n_, k_] := k!*Binomial[n, k]/((2 k - n)!*2^(n - k)); u[n_, k_] := t[2 n, k + n]; Table[ u[n, k], {n, 0, 8}, {k, 0, n}] // Flatten (* Robert G. Wilson v, Jan 14 2011 *)

Number triangle T(n,k) = (2n)!/((2k)!(n-k)!2^(n-k)).
T(n,k) = A122848(2n,k+n). - R. J. Mathar, Jan 14 2011
[x^(1/2)(1+2D)]^2 p(n,x)= p(n+1,x) and [D/(1+2D)]p(n,x)= n p(n-1,x) for the row polynomials of T, with D=d/dx. - Tom Copeland, Dec 26 2012
E.g.f.: exp[t*x/(1-2x)]/(1-2x)^(1/2). - Tom Copeland , Dec 10 2013
The n-th row polynomial R(n,x) is given by the type B Dobinski formula R(n,x) = exp(-x/2)*Sum_{k>=0} (2*k+1)*(2*k+3)*...*(2*k+1+2*(n-1))*(x/2)^k/k!. Cf. A113278. - Peter Bala, Jun 23 2014
The raising operator in my 2012 formula expanded is R = [x^(1/2)(1+2D)]^2 = 1 + x + (2 + 4x) D + 4x D^2, which in matrix form acting on an o.g.f. (formal power series) is the transpose of the production array below. The linear term x is the diagonal of ones after transposition. The main diagonal comes from (1 + 4xD) x^n = (1 + 4n) x^n. The last diagonal comes from (2 D + 4 x D^2) x^n = (2 + 4 xD) D x^n = n * (2 + 4(n-1)) x^(n-1). - Tom Copeland, Dec 13 2015
T(n, k) = (-2)^(n-k)*[x^k] KummerU(-n, 1/2, x). - Peter Luschny, Jan 18 2020

A080923 First differences of A003946.

Original entry on oeis.org

1, 3, 8, 24, 72, 216, 648, 1944, 5832, 17496, 52488, 157464, 472392, 1417176, 4251528, 12754584, 38263752, 114791256, 344373768, 1033121304, 3099363912, 9298091736, 27894275208, 83682825624, 251048476872, 753145430616

Offset: 0

Paul Barry, Feb 26 2003

Sum of consecutive pairs of elements of A025192.
The alternating sign sequence with g.f. (1-x^2)/(1+3x) gives the diagonal sums of A110168. - Paul Barry, Jul 14 2005
Let M = an infinite lower triangular matrix with the odd integers (1,3,5,...) in every column, with the leftmost column shifted up one row. Then A080923 = lim_{n->inf} M^n. - Gary W. Adamson, Feb 18 2010
a(n+1), n >= 0, with o.g.f. ((1-x^2)/(1-3*x)-1)/x = (3-x)/(1-3*x) provides the coefficients in the formal power series for tan(3*x)/tan(x) = (3-z)/(1-3*z) = Sum_{n>=0} a(n+1)*z^n, with z = tan(x)^2. Convergence holds for 0 <= z < 1/3, i.e., |x| < Pi/6, approximately 0.5235987758. For the numerator and denominator of this o.g.f. see A034867 and A034839, respectively. - Wolfdieter Lang, Jan 18 2013

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Index entries for linear recurrences with constant coefficients, signature (3).

Essentially the same as A005051, A026097 and A083583.

CoefficientList[Series[(1 - x^2) / (1 - 3 x), {x, 0, 20}], x] (* Vincenzo Librandi, Aug 05 2013 *)

G.f.: (1-x^2)/(1-3*x).
G.f.: 1/(1 - 3*x + x^2 - 3*x^3 + x^4 - 3*x^5 + ...). - Gary W. Adamson, Jan 06 2011
a(n) = 2^3*3^(n-2), n >= 2, a(0) = 1, a(1) = 3. - Wolfdieter Lang, Jan 18 2013

A119275 Inverse of triangle related to Padé approximation of exp(x).

Original entry on oeis.org

1, -2, 1, 0, -6, 1, 0, 12, -12, 1, 0, 0, 60, -20, 1, 0, 0, -120, 180, -30, 1, 0, 0, 0, -840, 420, -42, 1, 0, 0, 0, 1680, -3360, 840, -56, 1, 0, 0, 0, 0, 15120, -10080, 1512, -72, 1, 0, 0, 0, 0, -30240, 75600, -25200, 2520, -90, 1, 0, 0, 0, 0, 0, -332640, 277200, -55440, 3960, -110, 1

Offset: 0

Paul Barry, May 12 2006

Inverse of A119274.
Row sums are (-1)^(n+1)*A000321(n+1).
Bell polynomials of the second kind B(n,k)(1,-2). - Vladimir Kruchinin, Mar 25 2011
Also the inverse Bell transform of the quadruple factorial numbers Product_{k=0..n-1} (4*k+2) (A001813) giving unsigned values and adding 1,0,0,0,... as column 0. For the definition of the Bell transform see A264428 and for cross-references A265604. - Peter Luschny, Dec 31 2015

			Triangle begins
1,
-2, 1,
0, -6, 1,
0, 12, -12, 1,
0, 0, 60, -20, 1,
0, 0, -120, 180, -30, 1,
0, 0, 0, -840, 420, -42, 1,
0, 0, 0, 1680, -3360, 840, -56, 1,
0, 0, 0, 0, 15120, -10080, 1512, -72, 1
Row 4: D(x^4) = (1 - x*(d/dx)^2 + x^2/2!*(d/dx)^4 - ...)(x^4) = x^4 - 12*x^3 + 12*x^2.

Eric Weisstein's World of Mathematics, Bell Polynomial

Cf. A059344 (unsigned row reverse).

Cf. A034839, A001813, A001815, A086645, A098158, A130561, A231846.

# The function BellMatrix is defined in A264428.
# Adds (1,0,0,0, ..) as column 0.
BellMatrix(n -> `if`(n<2,(n+1)*(-1)^n,0), 9); # Peter Luschny, Jan 27 2016

Table[(-1)^(n - k) (n - k)!*Binomial[n + 1, k + 1] Binomial[k + 1, n - k], {n, 0, 10}, {k, 0, n}] // Flatten (* Michael De Vlieger, Oct 12 2016 *)
BellMatrix[f_Function, len_] := With[{t = Array[f, len, 0]}, Table[BellY[n, k, t], {n, 0, len - 1}, {k, 0, len - 1}]];
rows = 12;
M = BellMatrix[If[#<2, (#+1) (-1)^#, 0]&, rows];
Table[M[[n, k]], {n, 2, rows}, {k, 2, n}] // Flatten (* Jean-François Alcover, Jun 24 2018, after Peter Luschny *)

# uses[inverse_bell_matrix from A265605]
# Unsigned values and an additional first column (1,0,0, ...).
multifact_4_2 = lambda n: prod(4*k + 2 for k in (0..n-1))
inverse_bell_matrix(multifact_4_2, 9) # Peter Luschny, Dec 31 2015

T(n,k) = [k<=n]*(-1)^(n-k)*(n-k)!*C(n+1,k+1)*C(k+1,n-k).
From Peter Bala, May 07 2012: (Start)
E.g.f.: exp(x*(t-t^2)) - 1 = x*t + (-2*x+x^2)*t^2/2! + (-6*x^2+x^3)*t^3/3! + (12*x^2-12*x^3+x^4)*t^4/4! + .... Cf. A059344. Let D denote the operator sum {k >= 0} (-1)^k/k!*x^k*(d/dx)^(2*k). The n-th row polynomial R(n,x) = D(x^n) and satisfies the recurrence equation R(n+1,x) = x*R(n,x)-2*n*x*R(n-1,x). The e.g.f. equals D(exp(x*t)).
(End)
From Tom Copeland, Oct 11 2016: (Start)
With initial index n = 1 and unsigned, these are the partition row polynomials of A130561 and A231846 with c_1 = c_2 = x and c_n = 0 otherwise. The first nonzero, unsigned element of each diagonal is given by A001813 (for each row, A001815) and dividing along the corresponding diagonal by this element generates A098158 with its first column removed (cf. A034839 and A086645).
The n-th polynomial is generated by (x - 2y d/dx)^n acting on 1 and then evaluated at y = x, e.g., (x - 2y d/dx)^2 1 = (x - 2y d/dx) x = x^2 - 2y evaluated at y = x gives p_2(x) = -2x + x^2.
(End)

cp's OEIS Frontend

A382472 a(n) = Sum_{k=0..n} binomial(k+5,5) * binomial(2*k,2*n-2*k).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

A382473 a(n) = Sum_{k=0..n} binomial(k+6,6) * binomial(2*k,2*n-2*k).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

A382474 a(n) = Sum_{k=0..n} binomial(k+7,7) * binomial(2*k,2*n-2*k).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

A245564 a(n) = Product_{i in row n of A245562} Fibonacci(i+2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

A384891 Number of permutations of {1..n} with all distinct lengths of maximal runs (increasing by 1).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A384892 Number of permutations of {1..n} with all equal lengths of maximal runs (increasing by 1).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A062136 Twelfth column of Losanitsch's triangle A034851 (formatted as lower triangular matrix).

Views

Author

Keywords

Comments

A382472 a(n) = Sum_{k=0..n} binomial(k+5,5) * binomial(2k,2n-2*k).

A382473 a(n) = Sum_{k=0..n} binomial(k+6,6) * binomial(2k,2n-2*k).

A382474 a(n) = Sum_{k=0..n} binomial(k+7,7) * binomial(2k,2n-2*k).