This site is supported by donations to The OEIS Foundation.
Template:Sequence of the Day for October 5
From OeisWiki
Intended for: October 5, 2012
Timetable
- First draft entered by Daniel Forgues October 4, 2012 ✓
- Draft to be reviewed by August 5, 2011
- Draft to be approved by September 5, 2011
Yesterday's SOTD * Tomorrow's SOTD |
The line below marks the end of the <noinclude> ... </noinclude> section.
a (n) = a (a (n − 1)) + a (n − a (n − 1)) |
a (1) = a (2) = 1 |
- { 1, 1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 8, 8, 8, 8, ... }
This sequence acquired its name because John Horton Conway offered a prize of $10,000 to anyone who could demonstrate a particular result about its asymptotic behavior. The prize, since reduced to $1000, was claimed by Collin Mallows. (Comment from Hofstadter–Conway $10,000 sequence on Wikipedia.)