Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)

Revision History for A154844

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A154844 Triangle T(n, k) = S(n, k) + S(n, n-k), where S are the Stirling numbers (A048993) of the second kind, read by rows.
(history; published version)
#18 by Charles R Greathouse IV at Thu Sep 08 08:45:40 EDT 2022
PROG

(MAGMAMagma) [[StirlingSecond(n, k) + StirlingSecond(n, n-k): k in [0..n]]: n in [0..10]]; // G. C. Greubel, May 01 2019

Discussion
Thu Sep 08 08:45
OEIS Server: https://oeis.org/edit/global/2944
#17 by Bruno Berselli at Thu May 09 04:45:47 EDT 2019
STATUS

proposed

approved

#16 by Michel Marcus at Wed May 01 02:29:22 EDT 2019
STATUS

editing

proposed

#15 by Michel Marcus at Wed May 01 02:29:10 EDT 2019
NAME

Triangular sequence of Stirling numbers (A048993) of the secondTriangle kind: T(n, mk) = S(n, mk) + S(n, n-mk), where S are the Stirling numbers (A048993) of the second kind, read by rows.

STATUS

proposed

editing

Discussion
Wed May 01 02:29
Michel Marcus: ok ?
#14 by G. C. Greubel at Wed May 01 02:21:01 EDT 2019
STATUS

editing

proposed

#13 by G. C. Greubel at Wed May 01 02:20:38 EDT 2019
NAME

Symmetrical triangularTriangular sequence of Stirling numbers (A048993) of the second kind: tT(n,, m)=StirlingS2[) = S(n, m] + StirlingS2[) + S(n, n - -m].), read by rows.

DATA

2, 1, 1, 1, 2, 1, 1, 4, 4, 1, 1, 7, 14, 7, 1, 1, 11, 40, 40, 11, 1, 1, 16, 96, 180, 96, 16, 1, 1, 22, 203, 651, 651, 203, 22, 1, 1, 29, 393, 2016, 3402, 2016, 393, 29, 1, 1, 37, 717, 5671, 14721, 14721, 5671, 717, 37, 1, 1, 46, 1261, 15210, 56932, 85050, 56932, 15210, 1261, 46, 1

COMMENTS

Row sums are:: {2, 2, 4, 10, 30, 104, 406, 1754, 8280, 42294, 231950, ...}.

{2, 2, 4, 10, 30, 104, 406, 1754, 8280, 42294, 231950,...}

LINKS

G. C. Greubel, <a href="/A154844/b154844.txt">Rows n = 0..100 of triangle, flattened</a>

FORMULA

tT(n,, m)=StirlingS2[) = S(n, m] + StirlingS2[) + S(n, n - -m].), where S(n,k) = A048993(n,k).

Sum_{k, =0<=k<=..n} T(n,k) = 2*A000110(n). - Philippe Deléham, Feb 17 2013

EXAMPLE

{2},

Triangle begins as:

2;

{ 1, , 1},;

{ 1, , 2, , 1},;

{ 1, , 4, , 4, , 1},;

{ 1, , 7, , 14, , 7, , 1},;

{ 1, 11, , 40, , 40, , 11, , 1},;

{ 1, 16, , 96, , 180, , 96, , 16, , 1},;

{ 1, 22, , 203, , 651, , 651, , 203, , 22, , 1},;

{ 1, 29, , 393, , 2016, , 3402, , 2016, , 393, , 29, , 1},;

{ 1, 37, , 717, , 5671, 14721, 14721, , 5671, , 717, , 37, , 1},;

{ 1, 46, 1261, 15210, 56932, 85050, 56932, 15210, 1261, 46, 1};

MATHEMATICA

Clear[t, n, m]; tTable[n_, m_] = StirlingS2[n, m] + StirlingS2[n, n-m], {n - , 0, 10}, {m]; , 0, n}]//Flatten

Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}];

Flatten[%]

PROG

(PARI) {T(n, m) = stirling(n, k, 2) + stirling(n, n-m, 2)}; \\ G. C. Greubel, May 01 2019

(MAGMA) [[StirlingSecond(n, k) + StirlingSecond(n, n-k): k in [0..n]]: n in [0..10]]; // G. C. Greubel, May 01 2019

(Sage) [[stirling_number2(n, k) + stirling_number2(n, n-k) for k in (0..n)] for n in (0..10)] # G. C. Greubel, May 01 2019

CROSSREFS

Cf. A048993.

KEYWORD

nonn,tabl,uned

STATUS

approved

editing

#12 by N. J. A. Sloane at Wed Sep 16 19:34:19 EDT 2015
STATUS

editing

approved

#11 by N. J. A. Sloane at Wed Sep 16 19:34:17 EDT 2015
KEYWORD

nonn,tabl,uned,tabl

STATUS

approved

editing

#10 by N. J. A. Sloane at Fri Feb 22 14:39:34 EST 2013
FORMULA

Sum_{k, 0<=k<=n} T(n,k) = 2*A000110(n). - _DELEHAM Philippe Deléham_, Feb 17 2013

Discussion
Fri Feb 22 14:39
OEIS Server: https://oeis.org/edit/global/1863
#9 by Bruno Berselli at Mon Feb 18 06:04:32 EST 2013
STATUS

proposed

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 12 09:47 EDT 2024. Contains 375850 sequences. (Running on oeis4.)