|
|
A293346
|
|
Number of distinguishable configurations of the nearest larger value problem on an array of size n, using tiebreaking rule I: ties are broken by using the value to the right.
|
|
2
|
|
|
1, 1, 2, 5, 14, 40, 116, 341, 1010, 3009, 9012, 27087, 81658, 246841, 747728, 2269137, 6897656, 20996048, 63988866, 195237052, 596265104, 1822623729, 5575826696, 17069972962, 52292860854, 160295112707, 491629937802, 1508617457047, 4631590611528, 14225646628664
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
The terms can be computed using the formulas in Section 7 of [Hoffman et al.], which denotes this sequence as gamma_n.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|