The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A085615 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A085615

Duplicate of A054726.
(history; published version)

#3 by N. J. A. Sloane at Fri May 11 03:00:00 EDT 2007

NAME

Same as Duplicate of A054726.

#2 by N. J. A. Sloane at Sat Jun 12 03:00:00 EDT 2004

NAME

Non-crossing graphs with n nodes.

Same as A054726.

DATA

1, 1, 2, 8, 48, 352, 2880, 25216, 231168, 2190848, 21292032, 211044352, 2125246464, 21681954816, 223623069696, 2327818174464, 24424842461184, 258054752698368, 2742964283768832, 29312424612462592, 314739971287154688

OFFSET

0,1,3

LINKS

F. Cazals, <a href="http://algo.inria.fr/libraries/autocomb/NCC-html/NCC.html">Combinatorics of Non-Crossing Configurations</a>, Studies in Automatic Combinatorics, Volume II (1997).

MAPLE

br:={EA = Union(Sequence(EA, card >= 2), Prod(V, Sequence(EA), Sequence(EA))), V=Union(Prod(Z, G)), G=Union(Epsilon, Prod(Z, G), Prod(V, V, Sequence(EA), Sequence(EA), Sequence(Union(Sequence(EA, card>=1), Prod(V, Sequence(EA), Sequence(EA)))))) }; ggSeq:=[seq(count([G, br], size=i), i=0..20)];

KEYWORD

nonn,new

dead

AUTHOR

njas, Jul 10 2003

#1 by N. J. A. Sloane at Sat Sep 13 03:00:00 EDT 2003

NAME

Non-crossing graphs with n nodes.

DATA

OFFSET

0,3

LINKS

F. Cazals, <a href="http://algo.inria.fr/libraries/autocomb/NCC-html/NCC.html">Combinatorics of Non-Crossing Configurations</a>, Studies in Automatic Combinatorics, Volume II (1997).

MAPLE

KEYWORD

nonn

AUTHOR

njas, Jul 10 2003

STATUS

approved