The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A129880 Sequence d_n arising in enumeration of arrays of directed blocks (see Quaintance reference for precise definition). 2

%I

%S 1,1,4,10,32,101,334,1129,3890,13618,48275,172995,625574,2279997,

%T 8366553,30885640,114620926,427383918,1600323161,6015226752,

%U 22687991095,85843131701,325734335544,1239274254094,4726359853214,18065978123065

%N Sequence d_n arising in enumeration of arrays of directed blocks (see Quaintance reference for precise definition).

%H Jocelyn Quaintance, <a href="https://doi.org/10.1016/j.disc.2006.09.041">Combinatoric Enumeration of Two-Dimensional Proper Arrays</a>, Discrete Math., 307 (2007), 1844-1864.

%F See Quaintance reference for generating functions that produce A129872-A129886.

%F G.f.: D(t) satisfies (t^3 + t^2)*D^3 + (t^3 - t^2 - 2*t)*D^2 + (-t^2 - t + 1)*D - t = 0. _Michel Marcus_, Mar 29 2013

%o (PARI) listdn(m) = { my(D = t*O(t)); for (n= 1, m, D = (t - (t^3 + t^2)*D^3 - (t^3 - t^2 - 2*t)*D^2)/(1 - t - t^2);); return(vector(m, i , polcoeff(D, i, t)));} \\ _Michel Marcus_, Mar 29 2013

%K nonn

%O 1,3

%A _N. J. A. Sloane_, May 26 2007

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

Last modified June 14 09:06 EDT 2021. Contains 345018 sequences. (Running on oeis4.)