|
Search: id:A161774
|
|
|
| A161774 |
|
Upper bound on the number of left-associated formulas in O'Connor's puzzle, size of the free cartesian closed category over 3 objects. |
|
+0
1
|
|
| 1, 67108864, 3990838394187339929534246675572349035227, 63043209914231166739646464160229782088127582832744714668717269446793154834395536\ 9782628260078158650252906047844909056
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The sequence of exponents in a(n) = n^(b(n)) where b(n) = 3*(n^3)+2 = 5, 26, 83, 194, 377, ... seems not to be in OEIS.
|
|
LINKS
|
Michael O'Connor, An Interesting Puzzle in Propositional Logic, April 9, 2009.
|
|
FORMULA
|
a(n) = n^(3n^3+2).
|
|
EXAMPLE
|
a(2) = 2^26. a(3) = 3^83. a(4) = 2^388.
|
|
CROSSREFS
|
Sequence in context: A138085 A011576 A089081 this_sequence A158890 A084071 A104942
Adjacent sequences: A161771 A161772 A161773 this_sequence A161775 A161776 A161777
|
|
KEYWORD
|
easy,nonn,uned
|
|
AUTHOR
|
Jonathan Vos Post (jvospost3(AT)gmail.com), Jun 18 2009
|
|
|
Search completed in 0.002 seconds
|
