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!)
A297195 Number of bitriangular permutations (row sums of A272644 if that triangle is prefixed with a row for n=1). 3
1, 1, 2, 7, 28, 133, 726, 4483, 30896, 235105, 1957930, 17712799, 172980804, 1813760317, 20323234814, 242353047355, 3064550705752, 40958281206169, 576917769130578, 8541793624670551, 132623408805525740, 2154730841214003061, 36560670776303600422, 646697046042017004787 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Irving Kaplansky and John Riordan, The problem of the rooks and its applications, Duke Mathematical Journal 13.2 (1946): 259-268. The array is on page 267.
Irving Kaplansky and John Riordan, The problem of the rooks and its applications, in Combinatorics, Duke Mathematical Journal, 13.2 (1946): 259-268. [Annotated scanned copy]
MAPLE
A297195 := proc(n)
if n = 1 then
1;
else
add(A272644(n, m), m=1..n-1) ;
end if;
end proc:
seq(A297195(n), n=1..30) ; # R. J. Mathar, Mar 04 2018
MATHEMATICA
A272644[n_, m_] := Sum[StirlingS2[m+1, i+1] (-1)^(m-i) i^(n-m) i!, {i, 0, m}];
a[n_] := If[n == 1, 1, Sum[A272644[n, m], {m, 1, n-1}]];
Array[a, 24] (* Jean-François Alcover, Apr 03 2020 *)
CROSSREFS
Cf. A272644.
Sequence in context: A217203 A052319 A127783 * A116539 A266467 A370509
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jan 10 2018
STATUS
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 April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)