This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A157631 A general recursion triangle with third part a power triangle:m=4; Power triangle: f(n,k,m)=If[n*k*(n - k) == 0, 1, n^m - (k^m + (n - k)^m)]; Recursion: A(n,k,m)=(m*(n - k) + 1)*A(n - 1, k - 1, m) + (m*k + 1)*A(n - 1, k, m) + m*f(n, k, m)*A(n - 2, k - 1, m). 0
 1, 1, 1, 1, 66, 1, 1, 595, 595, 1, 1, 3684, 69846, 3684, 1, 1, 19909, 1933146, 1933146, 19909, 1, 1, 102246, 32826431, 367083252, 32826431, 102246, 1, 1, 515671, 437744405, 21290184979, 21290184979, 437744405, 515671, 1, 1, 2585160 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS Row sums are: {1, 2, 68, 1192, 77216, 3906112, 432940608, 43456890112, 7458742249216, 1239194473427968, 306328813704524800,...}. LINKS FORMULA m=0;Pascal:m=1;Eulerian numbers; m=4; Power triangle: f(n,k,m)=If[n*k*(n - k) == 0, 1, n^m - (k^m + (n - k)^m)]; Recursion: A(n,k,m)=(m*(n - k) + 1)*A(n - 1, k - 1, m) + (m*k + 1)*A(n - 1, k, m) + m*f(n, k, m)*A(n - 2, k - 1, m). EXAMPLE {1}, {1, 1}, {1, 66, 1}, {1, 595, 595, 1}, {1, 3684, 69846, 3684, 1}, {1, 19909, 1933146, 1933146, 19909, 1}, {1, 102246, 32826431, 367083252, 32826431, 102246, 1}, {1, 515671, 437744405, 21290184979, 21290184979, 437744405, 515671, 1}, {1, 2585160, 5091202876, 731091441592, 5986371789958, 731091441592, 5091202876, 2585160, 1}, {1, 12935689, 54443558020, 18708536794676, 600834243425598, 600834243425598, 18708536794676, 54443558020, 12935689, 1}, {1, 64692234, 551304588237, 397892494400440, 35386937552378930, 234758050872405116, 35386937552378930, 397892494400440, 551304588237, 64692234, 1} MATHEMATICA A[n_, 0, m_] := 1; A[n_, n_, m_] := 1; A[n_, k_, m_] := (m*(n - k) + 1)*A[n - 1, k - 1, m] + (m*k + 1)*A[n - 1, k, m] + m*f[n, k, m]*A[n - 2, k - 1, m]; Table[A[n, k, m], {m, 0, 10}, {n, 0, 10}, {k, 0, n}]; Table[Flatten[Table[Table[A[n, k, m], {k, 0, n}], {n, 0, 10}]], {m, 0, 10}] Table[Table[Sum[A[n, k, m], {k, 0, n}], {n, 0, 10}], {m, 0, 10}]; CROSSREFS Sequence in context: A238842 A059755 A215657 * A085503 A271711 A138843 Adjacent sequences:  A157628 A157629 A157630 * A157632 A157633 A157634 KEYWORD nonn,tabl,uned AUTHOR Roger L. Bagula, Mar 03 2009 STATUS approved

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 December 9 08:20 EST 2019. Contains 329877 sequences. (Running on oeis4.)