This site is supported by donations to The OEIS Foundation.
Template:Sequence of the Day for September 2
Intended for: September 2, 2011
Timetable
- First draft entered by Marvin Ray Burns on May 28, 2011 ✓
- Draft re-reviewed by Alonso del Arte on July 5, 2011 ✓
- Draft nominated for re-use on September 2, 2012 with appropriate adjustments (e.g., "67th" instead of "66th") by Alonso del Arte on July 22, 2011 ✓
- Draft approved by Charles R Greathouse IV on July 26, 2011 ✓
The following line marks the end of the <noinclude> ... </noinclude> section.
| a (0) = 0 |
| a (n) = 3 a (n − 1) = 3 ↑↑ (n − 1) |
| ↑ |
- { 0, 1, 3, 27, 7625597484987, ... }
where 7625597484987 is the largest writeable exponent in Graham’s number.
On this date 66 years ago WWII came to an abrupt end, and it was technology that played a crucial role in determining its outcome. Major developments in technology were made in weaponry, logistical support, medicine, industry, communications, and intelligence. To some extent these developments were the result of a quest for powerful computers, giving rise to Colossus, Mark 2, Zuse Z4, and ENIAC.
Today and in the foreseeable future, integer sequences like this one (e.g. tetrations) are nearly impossible to extend, even with powerful modern computers!
Authorship
The first version of this page was written by Marvin Ray Burns, 22:08, 28 May 2011 Daniel Forgues added ... Further remarks added by...
Cite this page as
Marvin Ray Burns and others, Template:Sequence_of_the_Day_for_September_2. — From the On-Line Encyclopedia of Integer Sequences® (OEIS®) wiki.Available at https://oeis.org/wiki/Template:Sequence_of_the_Day_for_September_2
