login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A298446 Triangle T(n,k) read by rows: number of n-node connected graphs with rectilinear crossing number k (k=0..A014540(n)). 1
1, 1, 2, 6, 20, 1, 99, 11, 1, 1, 646, 149, 38, 15, 1, 2, 1, 0, 0, 1, 5974, 3008, 1251, 542, 171, 80, 47, 12, 15, 7, 4, 1, 3, 0, 0, 1, 0, 0, 0, 1, 71885 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Computed up to n=8 using data provided by Geoffrey Exoo. (There appear to be some problems with n=9 data.)
T(9,1) >= 71335. - Eric W. Weisstein, Mar 28 2019
LINKS
Eric Weisstein's World of Mathematics, Connected Graph
Eric Weisstein's World of Mathematics, Rectilinear Crossing Number
FORMULA
T(n,0) = A003094(n).
kmax(n) = A014540(n).
T(n,kmax(n)) = 1 for n > 4.
sum(k=0..kmax(n), T(n,k)) = A001349(n).
EXAMPLE
Triangle begins:
1
1
2
6
20,1
99,11,1,1
646,149,38,15,1,2,1,0,0,1
5974,3008,1251,542,171,80,47,12,15,7,4,1,3,0,0,1,0,0,0,1
CROSSREFS
Cf. A014540 (rectilinear crossing number for K_n).
Cf. A298445 (counts for simple graph).
Sequence in context: A332406 A127942 A110956 * A364563 A357516 A205012
KEYWORD
nonn,tabf
AUTHOR
Eric W. Weisstein, Jan 19 2018
EXTENSIONS
Corrected by Eric W. Weisstein, Mar 28 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 20 15:48 EDT 2024. Contains 373526 sequences. (Running on oeis4.)