STATUS
editing
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A001144
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
AUTHOR
STATUS
approved
editing
STATUS
proposed
approved
STATUS
editing
proposed
REFERENCES
Problem E2118, Amer. Math. Monthly, 76 (1969), 830-831.
LINKS
S. W. Golomb and Judith Richman, <a href="https://www.jstor.org/stable/2317895">Problem E2118</a>, Amer. Math. Monthly, 76 (1969), 830-831.
STATUS
approved
editing
STATUS
editing
approved
COMMENTS
Largest number that can be expressed in the form a_1 ^ a_2 ^ ... ^ a_k, where a_1 + a_2 + ... + a_k = n. [From _- _Franklin T. Adams-Watters_, Apr 09 2010]
FORMULA
For n >= 7, a(n) = 2^a(n-2). [From _- _Franklin T. Adams-Watters_, Apr 09 2010]
STATUS
proposed
editing
STATUS
editing
proposed
COMMENTS
Largest number that can be expressed in the form a_1 ^ a_2 ^ ... ^ a_k, where a_1 + a_2 + ... + a_k = n. [From Franklin T. Adams-Watters, Apr 09 2010]
COMMENTS
Equivalently, largest number that can be expressed using the constant 1 exactly n times with only addition and exponentiation -- no concatenation of digits is allowed. (Comment to facilitate searching.) - Rick L. Shepherd, Jun 14 2017
STATUS
approved
editing