|
|
A290867
|
|
Irregular triangle read by rows: the number of points that are the intersections of k semicircles in the configuration A290447(n).
|
|
6
|
|
|
0, 0, 0, 0, 1, 0, 5, 0, 15, 0, 35, 0, 70, 0, 123, 1, 0, 195, 5, 0, 285, 15, 0, 420, 25, 0, 586, 39, 2, 0, 818, 53, 4, 0, 1110, 73, 6, 0, 1451, 103, 10, 0, 1846, 142, 18, 0, 2361, 181, 26, 0, 2956, 234, 33, 2, 0, 3704, 287, 40, 4, 0, 4567, 348, 49, 8
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,7
|
|
COMMENTS
|
The first entry of each row is 0, because an intersection requires at least 2 lines.
The first row with 3 entries is for n=9, because that is the first configuration with a nontrivial intersection.
|
|
LINKS
|
N. J. A. Sloane, Three (No, 8) Lovely Problems from the OEIS, Experimental Mathematics Seminar, Rutgers University, Oct 05 2017, Part I, Part 2, Slides. (Mentions this sequence)
N. J. A. Sloane (in collaboration with Scott R. Shannon), Art and Sequences, Slides of guest lecture in Math 640, Rutgers Univ., Feb 8, 2020. Mentions this sequence.
|
|
FORMULA
|
Sum_{k} T(n,k) * binomial(k,2) = binomial(n,4), because there are binomial(n,4) total pairs of semicircles, and an intersection of k consists of binomial(k,2) of those pairs.
A290865(n) = binomial(n,2) + Sum_{k} T(n,k) * (k-1).
|
|
EXAMPLE
|
Triangle begins:
0;
0;
0;
0, 1;
0, 5;
0, 15;
0, 35;
0, 70;
0, 123, 1;
0, 195, 5;
0, 285, 15;
0, 420, 25;
0, 586, 39, 2;
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|