This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A129821 Symmetric triangular sequence of powers: t(n,m)=m^n + (n - m)^n - n*m*(n - m). 0
 1, 1, 1, 4, 0, 4, 27, 3, 3, 27, 256, 70, 16, 70, 256, 3125, 1005, 245, 245, 1005, 3125, 46656, 15596, 4112, 1404, 4112, 15596, 46656, 823543, 279895, 78183, 18487, 18487, 78183, 279895, 823543, 16777216, 5764746, 1679776, 397066, 130944, 397066 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Row sum: Table[Apply[Plus, Table[t[n, m], {n, 0, m}]], {m, 0, 10}]; {1, 2, 8, 60, 668, 8750, 134132, 2400216, 49368552, 1148608890, 29828682200} ( not in OEIS either) Inspired by the necklace law: f(x,y,q)=x+y-q*x*y (C. Lenart: the family of formal group laws over the integers F_q(X,Y)=X+Y-qXY, q in Z: http://math.albany.edu:8000/math/pers/lenart/articles/fgl.html) LINKS FORMULA t(n,m)=m^n + (n - m)^n - n*m*(n - m) else if n=m=0, 1 EXAMPLE {1}, {1, 1}, {4, 0, 4}, {27, 3, 3, 27}, {256, 70, 16, 70, 256}, {3125, 1005, 245, 245, 1005, 3125}, {46656, 15596, 4112, 1404, 4112, 15596, 46656} MATHEMATICA t[m_, n_] = If [m == n == 0, 1, m^n + (n - m)^n - n*m*(n - m)]; aa = Table[Table[t[n, m], {n, 0, m}], {m, 0, 10}]; Flatten[aa] CROSSREFS Sequence in context: A087736 A005075 A103638 * A126836 A055241 A055242 Adjacent sequences:  A129818 A129819 A129820 * A129822 A129823 A129824 KEYWORD nonn,uned AUTHOR Roger L. Bagula, Jun 08 2007 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 January 20 03:32 EST 2019. Contains 319323 sequences. (Running on oeis4.)