A232496 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A232496

Triangle read by rows: T(n,k) (n >= 2, 1 <= k <= n-1) = Euclidean distance degree of variety of n X n matrices of rank <= k.

4, 13, 13, 40, 122, 40, 121, 1042, 1042, 121, 364, 8683, 23544, 8683, 364, 1093, 72271, 510835, 510835, 72271, 1093

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

2,1

COMMENTS

Column 1 appears to follow the recurrence T(n, 1) = 3*T(n-1, 1) + 1 (A003462, all ones in base 3). - Georg Fischer, Mar 05 2020

LINKS

Table of n, a(n) for n=2..22.

J. Draisma, E. Horobet, G. Ottaviani, B. Sturmfels and R. K. Thomas, The Euclidean distance degree of an algebraic variety, arXiv preprint arXiv: 1309.0049 [math.AG], 2013-2014, p. 24.

EXAMPLE

Triangle begins:

13, 13;

40, 122, 40;

121, 1042, 1042, 121;

364, 8683, 23544, 8683, 364;

1093, 72271, 510835, 510835, 72271, 1093;

...

CROSSREFS

Cf. A003462.

Sequence in context: A168401 A370644 A081738 * A239256 A043049 A135465

Adjacent sequences: A232493 A232494 A232495 * A232497 A232498 A232499

KEYWORD

nonn,tabl,more

AUTHOR

N. J. A. Sloane, Dec 03 2013

STATUS

approved