login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A152909
Largest k such that k! < 2^(2^n).
1
1, 2, 3, 5, 8, 12, 20, 34, 57, 98, 170, 300, 536, 966, 1754, 3210, 5910, 10944, 20366, 38064, 71421, 134480, 254016, 481176, 913846, 1739680, 3318996, 6344666, 12150874, 23310032, 44787927, 86181405, 166057045, 320370847, 618821160
OFFSET
0,2
COMMENTS
a(4) = 8 is the largest number whose factorial can be stored as a 16-bit unsigned integer.
a(5) = 12 is the largest number whose factorial can be stored as a 32-bit unsigned integer.
a(7) = 34 is the largest number whose factorial can be stored as an IEEE single-precision floating-point number (limit is just under 2^128).
a(10) = 170 is the largest number whose factorial can be stored as an IEEE double-precision floating-point number (limit is just under 2^1024).
a(14) = 1754 is the largest number whose factorial can be stored in common implementations of quadruple-precision floating-point numbers.
CROSSREFS
Cf. A119906.
Sequence in context: A117761 A274376 A018149 * A328597 A118604 A261694
KEYWORD
nonn
AUTHOR
Jon E. Schoenfield, Dec 15 2008
STATUS
approved