AbstractA generalization of the Seidel–Entringer–Arnold method for calculating the alternating permutation numbers (or secant–tangent numbers) leads to a new operation on sequences, the boustrophedon transform
AbstractCombinatorialists are interested in sequences of integers which count things. We often find ...
AbstractSchensted [Canad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspond...
We investigate the enumeration of non-crossing tree realizations of integer sequences, and we consid...
A generalization of the Seidel-Entringer-Arnold method for calculating the alternating permutation n...
AbstractA generalization of the Seidel–Entringer–Arnold method for calculating the alternating permu...
A generalization of the Seidel-Entringer-Arnold method for calculating the alternating permutation n...
18 pagesThe Seidel-Entringer triangle is a double indexed sequence $(E_{n,k})$ refining the Euler nu...
18 pagesThe Seidel-Entringer triangle is a double indexed sequence $(E_{n,k})$ refining the Euler nu...
AbstractWe study a sequence defined by the strange recurrence formula A(n)=A(A(A(n−1)))+A(n−A(A(n−1)...
AbstractIn their paper on Wilf-equivalence for singleton classes, Backelin, West, and Xin introduced...
Here we discuss the binary operators of the set made by the triangular numbers, sequence A000217, in...
International audienceThis Seidel Triangle Sequence Calculus makes it possible to derive several thr...
AbstractUp-down permutations, introduced many years ago by André under the name alternating permutat...
We show how various transformations of integer sequences, normally realized by Riordan or generalize...
AbstractGeneralizing the notion of up-down permutations, the author considers sequences σ = (a1, a2,...
AbstractCombinatorialists are interested in sequences of integers which count things. We often find ...
AbstractSchensted [Canad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspond...
We investigate the enumeration of non-crossing tree realizations of integer sequences, and we consid...
A generalization of the Seidel-Entringer-Arnold method for calculating the alternating permutation n...
AbstractA generalization of the Seidel–Entringer–Arnold method for calculating the alternating permu...
A generalization of the Seidel-Entringer-Arnold method for calculating the alternating permutation n...
18 pagesThe Seidel-Entringer triangle is a double indexed sequence $(E_{n,k})$ refining the Euler nu...
18 pagesThe Seidel-Entringer triangle is a double indexed sequence $(E_{n,k})$ refining the Euler nu...
AbstractWe study a sequence defined by the strange recurrence formula A(n)=A(A(A(n−1)))+A(n−A(A(n−1)...
AbstractIn their paper on Wilf-equivalence for singleton classes, Backelin, West, and Xin introduced...
Here we discuss the binary operators of the set made by the triangular numbers, sequence A000217, in...
International audienceThis Seidel Triangle Sequence Calculus makes it possible to derive several thr...
AbstractUp-down permutations, introduced many years ago by André under the name alternating permutat...
We show how various transformations of integer sequences, normally realized by Riordan or generalize...
AbstractGeneralizing the notion of up-down permutations, the author considers sequences σ = (a1, a2,...
AbstractCombinatorialists are interested in sequences of integers which count things. We often find ...
AbstractSchensted [Canad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspond...
We investigate the enumeration of non-crossing tree realizations of integer sequences, and we consid...
DOI
Add to ORKG