cp's OEIS Frontend

a(n) is also the number of induced subgraphs with odd number of edges in the path graph P(n) if n>0. - Alessandro Cosentino (cosenal(AT)gmail.com), Feb 06 2009

A common recurrence of the bisections A020522 and A006516 means a(n+4) = 6*a(n+2) - 8*a(n), n>1. - Yosu Yurramendi, Aug 07 2008

Also, the decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 566", based on the 5-celled von Neumann neighborhood, initialized with a single black (ON) cell at stage zero. - Robert Price, Jul 05 2017

Row sum of the unsigned triangle = A028361: (1, 2, 6, 30, 270, 4590, ...).

Right border of the unsigned triangle = A006125: (1, 1, 2, 8, 64, 1024, ...).

From Philippe Deléham, Mar 20 2009: (Start)

Unsigned triangle: A077957(n) DELTA A007179(n+1) = [1,0,2,0,4,0,8,0,16,0,32,0,...]DELTA[1,1,4,6,16,28,64,120,256,496,...], where DELTA is the operator defined in A084938.

Signed triangle: [1,0,2,0,4,0,8,0,16,0,...]DELTA[-1,-1,-4,-6,-16,-28,-64,...]. (End)

A vertex-coloring of a graph G is called distinguishing if it is only preserved by the identity automorphism of G. This notion is considered in the subject of symmetry breaking of simple (finite or infinite) graphs. A distinguishing coloring partition of a graph G is a partition of the vertices of G such that it induces a distinguishing coloring for G. We say two distinguishing coloring partitions P1 and P2 of G are equivalent if there is a nontrivial automorphism of G which maps P1 onto P2. Given a graph G, we use the notation psi_k(G) to denote the number of non-equivalent distinguishing coloring partitions of G with at exactly k parts. For n>=1, this sequence gives T(n,k) = psi_k(P_n), i.e., the number of non-equivalent distinguishing coloring partitions of the path P_n on n vertices with exactly k parts.

Also, for n > 1 the number of reversible string structures of length n using exactly k different symbols that are not equivalent to their reversal (compare A284949). - Andrew Howroyd, Aug 15 2019

Number of symmetric chiral (optically active) isomers possible for organic compounds with n distinct carbon atoms.

A020522 interleaved with A004171 and apparently the number of asymmetric Dyck (n+2)-paths with exactly half of the steps lying between the first and last peaks; e.g. all asymmetric 3-paths (UU*DDU*D and U*DUU*DD) comply so a(1)=2. - David Scambler, Sep 14 2012

Limit(n->infinity) a(n+1)/a(n)=3.

The sequence can be created by multiplying the n-th power of the matrix [[0,1,2],[1,2,0],[2,0,1]], multiplying from the right with the vector [1,0,0] and taking the middle element of the resulting vector.

Row sums equal 0^n.

Row n contains the coefficients of Product_{j=0..n-1} (2^j*x-1), highest coefficient first. - Alois P. Heinz, Mar 26 2012

The elements of the matrix inverse are apparently given by T^(-1)(n,k) = (-1)^k*A022166(n,k). - R. J. Mathar, Mar 26 2013

A vertex-coloring of a graph G is called distinguishing if it is only preserved by the identity automorphism of G. This notion is considered in the subject of symmetry breaking of simple (finite or infinite) graphs. A distinguishing coloring partition of a graph G is a partition of the vertices of G such that it induces a distinguishing coloring for G. We say two distinguishing coloring partitions P1 and P2 of G are equivalent if there is a nontrivial automorphism of G which maps P1 onto P2. Given a graph G, we use the notation Psi_k(G) to denote the number of non-equivalent distinguishing coloring partitions of G with at most k parts. This sequence gives A(n,k) = Psi_k(P_n), i.e., the number of non-equivalent distinguishing coloring partitions of the path P_n on n vertices with at most k parts.

Note that, for any graph G, Psi_k(G) = Sum_{i<=k} psi_i(G), where psi_i(G) is the number of non-equivalent distinguishing coloring partitions of G with exactly i parts. For instance, here we have T(n,k) = Sum_{i<=k} A309748(n,i).

Row sums are A007179(n+1).