The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A161774 a(n) = n^(3n^3 + 2). 1
 1, 67108864, 3990838394187339929534246675572349035227 (list; graph; refs; listen; history; text; internal format)
 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

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

Last modified December 3 05:03 EST 2023. Contains 367531 sequences. (Running on oeis4.)