Talk:Puzzles/Number sequences

All of these are labeled "easy", but I suppose somebody has to write the answer.

1 2 4 8 ?                 16        s(n) = 2^n 1 2 4 7 ?                 11        s(n) = (n+1)(n+2)/2+1 1 2 6 14 ?                30        s(0) = 1, s(n) = s(n-1)+n^2 33       Partitions of n objects of 2 colors. (Euler transform of b(n) = n+1) 3 2 4 1 ?                 5         s(2n+1) = 2-n, s(2n) = 3+n 3 2 4 1 ?                 repeat of last (error?) 3 9 27 81 ?               243       s(n) = 3^(n+1) 2 3 5 8 13 21 ?           34        s(-2) = 1, s(-1) = 1, s(n) = s(n-1)+s(n-2) s(n) = Fib(n+3) 1 0 1 0 1 0 1 1 0 1 0 1             s(n) = (n+1) mod 2 ^^^        guessing typo
 * No, this is no typo. Think again ! :-)

2 3 6 7 1 9 4 5 8                   ?????????? something mod 10??? must be missing something obvious

looks like this is in reverse alphabetical order: two three six seven one nine four five eight Thomas

Eric119 23:32, 12 Oct 2003 (UTC) (edited)

I decided not to try this one... Think there's more than $$\aleph_0$$ possible solutions... Cyp 14:23, 18 Oct 2003 (UTC)

Hmmm, accidentally glanced at one for too long... Shouldn't 1 0 1 0 1 0 1 1 0 1 0 1 actually be 1 -2 1 0 1 0 1 1 0 1 0 1 most of the time, but occasionally 1 -1 1 0 1 0 1 1 0 1 0 1? Cyp 14:45, 18 Oct 2003 (UTC)