| Display title | Smallest number k such that k+2^m is composite for all m less than k |
| Default sort key | Smallest number k such that k+2^m is composite for all m less than k |
| Page length (in bytes) | 14,935 |
| Namespace ID | 0 |
| Page ID | 14104 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Page views in the past month | 0 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | Thundergnat (talk | contribs) |
| Date of page creation | 23:50, 11 January 2022 |
| Latest editor | Retired Build Engineer (talk | contribs) |
| Date of latest edit | 21:00, 19 January 2025 |
| Total number of edits | 22 |
| Recent number of edits (within past 180 days) | 2 |
| Recent number of distinct authors | 2 |
| Hidden category (1) | This page is a member of a hidden category:
|
| Transcluded templates (9) | Templates used on this page:
|
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Generate the sequence of numbers a(k), where each k is the smallest positive integer such that k + 2m is composite for every positive integer m less than k. For... |
