A334211 a(n) = 1 + a(n-1)*(A007018(n-1) + 1), with a(0) = 1.
1, 3, 10, 71, 3054, 5518579, 18009568007498, 191802924939285448393150887, 21754999921504126977590785836876485101156736372842942
Offset: 0
Keywords
Links
- A. Yu. Chirkov, D. V. Gribanov and N. Yu. Zolotykh, On the Proximity of the Optimal Values of the Multi-Dimensional Knapsack Problem with and without the Cardinality Constraint, arXiv:2004.08589 [math.OC], 2020.
- A. Yu. Chirkov and V. N. Shevchenko, On the approximation of an optimal solution of the integer knapsack problem by optimal solutions of the integer knapsack problem with a restriction on the cardinality, Diskretn. Anal. Issled. Oper., Ser. 2, 13 (2) (2006), 56-73.
- R. Kohli, and R. Krishnamurti, A total-value greedy heuristic for the integer knapsack problem, Operations Research Letters, 12 (1992), 65-71.
Crossrefs
Cf. A007018.
Extensions
Definition has been replaced by the explicit recurrence in terms of A007018. - N. J. A. Sloane, Sep 14 2020
Comments