login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093965 Number of functions of [n] to [n] that simultaneously avoid the patterns 112 and 221. 3
1, 4, 21, 124, 825, 6186, 51961, 484968, 4988241, 56117710, 685883121, 9053657196, 128397320233, 1947359356866, 31457343457065, 539268744978256, 9778739908939041, 187018400758459158, 3762370179964296001, 79427814910357360020, 1755772750650004800441
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = A093966(n, n).
From Vaclav Kotesovec, Nov 20 2012: (Start)
E.g.f.: x*(exp(x) - x)/(1-x)^2.
Recurrence: (n-1)*a(n) = n*(n+1)*a(n-1) - (n-1)*n*a(n-2) for n>2.
a(n) ~ n!*n*(e-1). (End)
MATHEMATICA
Rest[CoefficientList[Series[x(E^x-x)/(1-x)^2, {x, 0, 20}], x]* Range[0, 20]!] (* Vaclav Kotesovec, Nov 20 2012 *)
PROG
(PARI) my(x='x+O('x^66)); Vec(serlaplace(x*(exp(x)-x)/(1-x)^2)) \\ Joerg Arndt, May 11 2013
(Magma) [n le 2 select 4^(n-1) else n*((n+1)*Self(n-1) - (n-1)*Self(n-2))/(n-1): n in [1..30]]; // G. C. Greubel, Dec 29 2021
(Sage) [factorial(n)*( x*(exp(x) -x)/(1-x)^2 ).series(x, n+1).list()[n] for n in (1..30)] # G. C. Greubel, Dec 29 2021
CROSSREFS
Cf. A093966.
Sequence in context: A101478 A153291 A244062 * A370545 A366115 A195262
KEYWORD
nonn
AUTHOR
Ralf Stephan, Apr 20 2004
EXTENSIONS
Name changed by Olivier Gérard, Aug 06 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 18 15:05 EDT 2024. Contains 376000 sequences. (Running on oeis4.)