login
A260016
Smallest number requiring n digits for its representation in the "Terrible Twos Problem" without using multidigit expressions.
2
3, 2, 7, 13, 21, 41, 91, 269, 419, 921, 2983, 8519, 18859, 53611, 136631, 436341
OFFSET
2,1
REFERENCES
C. Pickover, Mazes for the Mind, St. Martin's Press, NY, 1992, p. 376.
C. Pickover, "Wonders of Numbers", Chapter 78, 'Creator Numbers', Oxford University Press, NY, 2001. pp. 187-189, 343-345.
LINKS
C. Pickover, "The Terrible Twos Problem", Chapter 73, 'Mazes for the Mind', St. Martin's Press, NY, 1992, p. 373-377. (Annotated scanned copy)
CROSSREFS
Cf. A060273.
Sequence in context: A114647 A234750 A052546 * A320769 A358283 A363584
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Jul 13 2015, following a suggestion from Robert G. Wilson v, Aug 25 1983
STATUS
approved