cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A152909 Largest k such that k! < 2^(2^n).

Original entry on oeis.org

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

Views

Author

Jon E. Schoenfield, Dec 15 2008

Keywords

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.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.