Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080635
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080635 Number of permutations on n letters without double falls and without initial falls. +0
3
1, 1, 1, 3, 9, 39, 189, 1107, 7281, 54351, 448821, 4085883, 40533129, 435847959, 5045745069, 62594829027, 828229153761, 11644113200031, 173331882039141, 2723549731505163, 45047085512477049, 782326996336904679 (list; graph; listen)
OFFSET

0,4

COMMENT

A permutation w has a double fall at k if w(k) > w(k+1) > w(k+2) and has an initial fall if w(1) > w(2).

E.g.f. A(x) satisfies A'=1-A+A^2. - Michael Somos, Oct 04 2003

exp(x*(1-y+y^2)*D_y)*f(y)|_{y=0} = f(1-E(-x)) for any function f with a Taylor series. D_y means differentiation with respect to y and E(x) is the e.g.f. given below. For a proof of exp(x*g(y)*D_y)*f(y) = f(F^{-1}(x+F(y))) with the compositional inverse F^{-1} of F(y)=int(1/g(y),y) with F(0)=0 see, e.g., the Datolli et al. reference.

a(n) = number of increasing ordered trees on vertex set {1,2,...,n}, rooted at 1, in which all outdegrees are <=2. - David Callan (callan(AT)stat.wisc.edu), Mar 30 2007

REFERENCES

M. Aigner, Catalan and other numbers: a recurrent theme, Algebraic combinatorics and computer science, 347-390, Springer Italia, Milan, 2001.

G. Datolli, P. L. Ottaviani, A. Torre and L. V\'azquez, Evolution operator equations: integrationn with algebraic and finite differences methods.[...], Rivista del Nuovo Cimento 20,2 (1997) 1-133. eq. (I.2.18).

FORMULA

G.f. : ( 1 + 1/Sqrt[3] Tan[Sqrt[3]/2 x] ) / ( 1 - 1/Sqrt[3] Tan[Sqrt[3]/2 x] ) Recurrece: a(n+1) = Sum[ Binomial[n, k] a(k) a(n-k), {k, 0, n} ] - a(n) + 0^n

E.g.f.: E(x)=(3*cos(1/2*3^(1/2)*x)+(3^(1/2))*sin(1/2*3^(1/2)*x))/(3*cos(1/2*3^(1/2)*x)-(3^(1/2))* sin(1/2*3^(1/2)*x)). See the M. Somos comment. W. Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Sep 12 2005.

O.g.f.: A(x) = 1+x/(1-x-2*x^2/(1-2*x-2*3*x^2/(1-3*x-3*4*x^2/(1-... -n*x-n*(n+1)*x^2/(1- ...))))) (continued fraction). - Paul D. Hanna (pauldhanna(AT)juno.com), Jan 17 2006

EXAMPLE

For n = 3 : 123, 132, 231. For n = 4 : 1234, 1243, 1324, 1342, 1423, 2314, 2341, 2413, 3412.

MATHEMATICA

Table[n! SeriesCoefficient[Series[ (1 + 1/Sqrt[3] Tan[Sqrt[3]/2 x])/(1 - 1/Sqrt[3] Tan[Sqrt[3]/2 x]), {x, 0, n}], n], {n, 0, 40}]

PROGRAM

(PARI) a(n)=local(A); if(n<1, n==0, A=O(x); for(k=1, n, A=intformal(1+A+A^2)); n!*polcoeff(A, n))

CROSSREFS

Cf. A049774.

Sequence in context: A149026 A149027 A121101 this_sequence A130905 A030799 A058105

Adjacent sequences: A080632 A080633 A080634 this_sequence A080636 A080637 A080638

KEYWORD

easy,nonn

AUTHOR

Emanuele Munarini (munarini(AT)mate.polimi.it), Feb 28 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research