0,2

Half the number of 2 X (n+2) binary arrays with both a path of adjacent 1's and a path of adjacent 0's from top row to bottom row. - Ron Hardin (rhhardin(AT)att.net), Mar 21 2002

As (0,0,1,9,55,...) this is the third binomial transform of cosh(x)-1. It is the binomial transform of A000392, when this has two leading zeros. Its e.g.f. is then exp(3x)cosh(x)-exp(3x) and a(n)=(4^n-2*3^n+2^n)/2. - Paul Barry (pbarry(AT)wit.ie), May 13 2003

Let P(A) be the power set of an n-element set A. Then a(n-2) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are disjoint and for which x is not a subset of y and y is not a subset of x, or 1) x and y are intersecting but for which x is not a subset of y and y is not a subset of x. - Ross La Haye (rlahaye(AT)new.rr.com), Jan 10 2008

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 292, #8, s(n,2).

Ross La Haye, Binary Relations on the Power Set of an n-Element Set, Journal of Integer Sequences, Vol. 12 (2009), Article 09.2.6. [From Ross La Haye (rlahaye(AT)new.rr.com), Feb 22 2009]

Index entries for sequences related to linear recurrences with constant coefficients

K. S. Brown, Dedekind's problem

Vladeta Jovovic, Illustration for A016269, A047707, A051112-A051118

Index entries for sequences related to Boolean functions

Goran Kilibarda and Vladeta Jovovic, Antichains of Multisets, J. Integer Seqs., Vol. 7, 2004.

G.f.: 1/((1-2x)(1-3x)(1-4x)). a(n) = (2^n)*(2^n - 1)/2 - 3^n + 2^n.

a(n)=sum{0<=i,j,k,<=n, i+j+k=n, 2^i*3^j*4^k}. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 25 2007

a(n)=2^(n+1)*(1+2^(n+2))-3^(n+2). - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 25 2007

a(n) = 3*StirlingS2(n+1,4) + StirlingS2(n+1,3). - Ross La Haye (rlahaye(AT)new.rr.com), Jan 10 2008

If we define f(m,j,x)=sum(binomial(m,k)*stirling2(k,j)*x^(m-k),k=j..m) then a(n-2)=f(n,2,2), (n>=2). [From Milan R. Janjic (agnus(AT)blic.net), Apr 26 2009]

with(combinat):a:=n->stirling2(n, 4)-stirling2(n-1, 4): seq(a(n), n=4..24); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 05 2007

Equals (1/2) A038721(n+1). First differences of A000453. Partial sums of A027650. Pairwise sums of A099110. Odd part of A019333.

Cf. A000392, A032263.

Sequence in context: A145875 A068970 A141530 this_sequence A005770 A030053 A072844

Adjacent sequences: A016266 A016267 A016268 this_sequence A016270 A016271 A016272

nonn

N. J. A. Sloane (njas(AT)research.att.com).