|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|