Timeline for Exponential-ish number sequence

13 events

when toggle format	what		by	license	comment
Dec 28, 2017 at 12:17	comment	added	FlipTack		54 using the OP's method, but probably can't be golfed to be shorter than yours
Dec 27, 2017 at 22:19	history	edited	Mr. Xcoder	CC BY-SA 3.0	added 324 characters in body
Dec 27, 2017 at 21:47	history	edited	Wheat Wizard♦	CC BY-SA 3.0	edited body
Dec 27, 2017 at 21:47	comment	added	Mr. Xcoder		@WheatWizard Since this is kolmo-complexity, recursion should (theoretically) not be shorter
Dec 27, 2017 at 21:46	comment	added	Wheat Wizard♦		Don't know if it helps but, *f(n)=2(f(n-1)+n)** for all n except 0
Dec 27, 2017 at 21:42	history	edited	Mr. Xcoder	CC BY-SA 3.0	deleted 685 characters in body
Dec 27, 2017 at 21:41	comment	added	Mr. Xcoder		@WheatWizard Thanks! That was the cleverish trick I was looking for!
Dec 27, 2017 at 21:40	comment	added	Wheat Wizard♦		51
Dec 27, 2017 at 20:58	history	edited	Mr. Xcoder	CC BY-SA 3.0	deleted 19 characters in body
Dec 27, 2017 at 20:51	history	edited	Mr. Xcoder	CC BY-SA 3.0	deleted 6 characters in body
Dec 27, 2017 at 20:38	comment	added	Steadybox		I wrote exactly the same `for i in range(18):print(2*i-i)2-(i<1) print"NOPE!"` solution, but was too late, it seems :)
Dec 27, 2017 at 20:33	history	edited	Mr. Xcoder	CC BY-SA 3.0	added 46 characters in body
Dec 27, 2017 at 20:26	history	answered	Mr. Xcoder	CC BY-SA 3.0