A260016 - OEIS

%I #15 Dec 27 2017 10:42:10

%S 3,2,7,13,21,41,91,269,419,921,2983,8519,18859,53611,136631,436341

%N Smallest number requiring n digits for its representation in the "Terrible Twos Problem" without using multidigit expressions.

%D C. Pickover, Mazes for the Mind, St. Martin's Press, NY, 1992, p. 376.

%D C. Pickover, "Wonders of Numbers", Chapter 78, 'Creator Numbers', Oxford University Press, NY, 2001. pp. 187-189, 343-345.

%H C. Pickover, <a href="/A260016/a260016.pdf">"The Terrible Twos Problem", Chapter 73, 'Mazes for the Mind'</a>, St. Martin's Press, NY, 1992, p. 373-377. (Annotated scanned copy)

%Y Cf. A060273.

%K nonn,more

%O 2,1

%A _N. J. A. Sloane_, Jul 13 2015, following a suggestion from _Robert G. Wilson v_, Aug 25 1983