login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001144 An exponential function on partitions (next term is 2^512).
(Formerly M0593 N0214)
0
1, 2, 3, 4, 9, 27, 512, 134217728 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Largest number that can be expressed in the form a_1 ^ a_2 ^ ... ^ a_k, where a_1 + a_2 + ... + a_k = n. - Franklin T. Adams-Watters, Apr 09 2010

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

REFERENCES

Problem E2118, Amer. Math. Monthly, 76 (1969), 830-831.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=1..8.

FORMULA

For n >= 7, a(n) = 2^a(n-2). - Franklin T. Adams-Watters, Apr 09 2010

CROSSREFS

Cf. A000792, A014221. - Franklin T. Adams-Watters, Apr 09 2010

Sequence in context: A076381 A282571 A063455 * A121253 A014118 A007704

Adjacent sequences:  A001141 A001142 A001143 * A001145 A001146 A001147

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 20 00:51 EST 2018. Contains 299357 sequences. (Running on oeis4.)