Forwards triggered by the stackers in #693062.
Hint: there are infinitely many sequences that start with any finite set of initial terms. The proper answer is D.
I'll post a video later to illustrate this for answer C, 31. Need to sleep now.
reply
I thought about that, but as a programmer, powers of two are always popping up in my head.
reply
32, 64,128,256,1024,2048
2^x
reply
You are not a mathematician~~
(it's a correct answer though)
I'll let others shine in before elaborating...
reply
i'm not mathematician, i'm a programmer!
reply
21 sats \ 3 replies \ @suraz 20 Sep
31
reply
reply
186 sats \ 1 reply \ @suraz 20 Sep
We can demonstrate through circle connecting dots. Like 1 dot is 1 region, connect 2 dots that form 2 regions, connect 3 dots that form 4 regions, connect 4 dots that form 8 regions, connect 5 dots and we get 16 regions, connect 6 dots and we get 31 regions and so on. We explored this back in college days.