login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102413 Triangle read by rows: T(n,k) is the number of k-matchings of the corona C'(n) of the cycle graph C(n) and the complete graph K(1); in other words, C'(n) is the graph constructed from C(n) to which for each vertex v a new vertex v' and the edge vv' is added. 6
1, 1, 1, 1, 4, 1, 1, 6, 6, 1, 1, 8, 16, 8, 1, 1, 10, 30, 30, 10, 1, 1, 12, 48, 76, 48, 12, 1, 1, 14, 70, 154, 154, 70, 14, 1, 1, 16, 96, 272, 384, 272, 96, 16, 1, 1, 18, 126, 438, 810, 810, 438, 126, 18, 1, 1, 20, 160, 660, 1520, 2004, 1520, 660, 160, 20, 1, 1, 22, 198, 946, 2618, 4334, 4334, 2618, 946, 198, 22, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,5

COMMENTS

Row n contains n+1 terms. Row sums yield A099425. T(n,k)=T(n,n-k)

For n > 2: same recurrence like A008288 and A128966. - Reinhard Zumkeller, Apr 15 2014

REFERENCES

J. L. Gross and J. Yellen, Handbook of Graph Theory, CRC Press, Boca Raton, 2004, p. 894.

F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969, p. 167.

LINKS

Reinhard Zumkeller, Rows n = 0..125 of table, flattened

FORMULA

G.f.=G(t, z)=(1+tz^2)/[1-(1+t)z-tz^2].

For n > 2: T(n,k) = T(n-1,k-1) + T(n-1,k) - T(n-2,k-1), 0 < k < n. - Reinhard Zumkeller, Apr 15 2014

EXAMPLE

T(3,2)=6 because in the graph with vertex set {A,B,C,a,b,c} and edge set {AB,AC,BC,Aa,Bb,Cc} we have the following six 2-matchings: {Aa,BC},{Bb,AC},{Cc,AB},{Aa,Bb},{Aa,Cc} and {Bb,Cc}.

The triangle starts:

1;

1,1;

1,4,1;

1,6,6,1;

1,8,16,8,1;

MAPLE

G:=(1+t*z^2)/(1-(1+t)*z-t*z^2): Gser:=simplify(series(G, z=0, 38)): P[0]:=1: for n from 1 to 11 do P[n]:=coeff(Gser, z^n) od:for n from 0 to 11 do seq(coeff(t*P[n], t^k), k=1..n+1) od; # yields sequence in triangular form

PROG

(Haskell)

a102413 n k = a102413_tabl !! n !! k

a102413_row n = a102413_tabl !! n

a102413_tabl = [1] : [1, 1] : f [2] [1, 1] where

   f us vs = ws : f vs ws where

             ws = zipWith3 (((+) .) . (+))

                  ([0] ++ us ++ [0]) ([0] ++ vs) (vs ++ [0])

-- Reinhard Zumkeller, Apr 15 2014

CROSSREFS

Cf. A099425.

Cf. A241023 (central terms).

Sequence in context: A132046 A141540 A143188 * A144480 A144463 A174376

Adjacent sequences:  A102410 A102411 A102412 * A102414 A102415 A102416

KEYWORD

nonn,tabl

AUTHOR

Emeric Deutsch, Jan 07 2005

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 26 13:30 EST 2014. Contains 250079 sequences.