Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071107
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071107 a(n) is the greatest integer that can be obtained from the integers {1, 2, 3, ..., n} using each number at most once and the operators +,-,*,/,^. +0
5
1, 3, 27, 115792089237316195423570985008687907853269984665640564039457584007913129639936 (list; graph; listen)
OFFSET

1,2

COMMENT

a(4) = 2^(4^4) = 2^256 = 115792089237316195423570985008687907853269984665640564039457584007913129639936 with 78 digits. a(5) = 2^(3^(4^6)) with more than 10^1950 digits.

EXAMPLE

a(3) = 27 because 3^(2+1) = 27 is the greatest integer that can be obtained by using 1, 2, 3 once and the operations +, -, *, /, ^.

CROSSREFS

Cf. A070960.

Sequence in context: A055777 A014222 A162414 this_sequence A146072 A073049 A064234

Adjacent sequences: A071104 A071105 A071106 this_sequence A071108 A071109 A071110

KEYWORD

nonn

AUTHOR

Koksal Karakus (karakusk(AT)hotmail.com), May 27 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research