A161774 a(n) = n^(3n^3 + 2).

1, 67108864, 3990838394187339929534246675572349035227

Offset

1,2

Comments

This provides an upper bound on the number of left-associated formulas in O'Connor's puzzle, size of the free Cartesian closed category over 3 objects.

a(n) too big to include in data sections for n>=4.

Links

G. C. Greubel, Table of n, a(n) for n = 1..7

Michael O'Connor, An Interesting Puzzle in Propositional Logic, April 9, 2009.

Example

a(2) = 2^26; a(3) = 3^83; a(4) = 2^388.

Maple

seq(n^(3*n^3+2), n=1..4); # Muniru A Asiru, Oct 25 2018

Mathematica

Table[n^(3*n^3 + 2), {n, 1, 9}] (* G. C. Greubel, Oct 24 2018 *)

Prog

(PARI) vector(9, n, n^(3*n^3 + 2)) \\ G. C. Greubel, Oct 24 2018
(Magma) [n^(3*n^3 + 2): n in [1..9]]; // G. C. Greubel, Oct 24 2018
(GAP) List([1..4], n->n^(3*n^3+2)); # Muniru A Asiru, Oct 25 2018

Crossrefs

Sequence in context: A263392 A011576 A089081 * A203670 A353203 A183707

Adjacent sequences: A161771 A161772 A161773 * A161775 A161776 A161777

Keyword

easy,nonn

Author

Jonathan Vos Post, Jun 18 2009

Status

approved