# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a257113 Showing 1-1 of 1 %I A257113 #59 Jul 18 2023 09:22:24 %S A257113 2,3,5,10,20,40,80,160,320,640,1280,2560,5120,10240,20480,40960,81920, %T A257113 163840,327680,655360,1310720,2621440,5242880,10485760,20971520, %U A257113 41943040,83886080,167772160,335544320,671088640,1342177280,2684354560,5368709120,10737418240 %N A257113 a(1) = 2, a(2) = 3; thereafter a(n) is the sum of all the previous terms. %C A257113 Except for first three terms, a(n) is 10 times 2^(n-4). %C A257113 These values comprise the tile values used in the "fives" variant of the game 2048, including 1 as the zeroth term. - _Michael De Vlieger_, Jul 18 2018 %H A257113 Colin Barker, Table of n, a(n) for n = 1..1000 %H A257113 E. R. Berlekamp, A contribution to mathematical psychometrics, Unpublished Bell Labs Memorandum, Feb 08 1968 [Annotated scanned copy] %H A257113 David Eppstein, Making Change in 2048, arXiv:1804.07396 [cs.DM], 2018. %H A257113 Index entries for linear recurrences with constant coefficients, signature (2). %F A257113 a(n) = A020714(n-3) for n>2. %F A257113 a(n) = A146523(n-2) for n>2. - _R. J. Mathar_, May 14 2015 %F A257113 G.f.: x*(1 - x)*(2 + x) / (1 - 2*x). - _Colin Barker_, Nov 17 2018 %t A257113 t = {2, 3}; For[k = 3, k <= 27, k++, AppendTo[t, Total@ t]]; t (* _Michael De Vlieger_, May 14 2015 *) %t A257113 Join[{2, 3}, Table[5 2^n, {n, 0, 40}]] (* _Vincenzo Librandi_, May 15 2015 *) %t A257113 Join[{2,3},NestList[2#&,5,40]] (* _Harvey P. Dale_, Apr 06 2018 *) %o A257113 (Magma) [2,3] cat [5*2^n: n in [0..35]]; // _Vincenzo Librandi_, May 15 2015 %o A257113 (PARI) a(n) = if(n<3, n+1, 5*2^(n-3)); \\ _Altug Alkan_, Jul 18 2018 %o A257113 (PARI) Vec(x*(1 - x)*(2 + x) / (1 - 2*x) + O(x^40)) \\ _Colin Barker_, Nov 17 2018 %o A257113 (PARI) a(n) = ceil(5*2^(n-3)) \\ _Alan Michael Gómez Calderón_, Mar 30 2022 %Y A257113 Cf. A000079, A020714, A084215. %K A257113 nonn,easy,less %O A257113 1,1 %A A257113 _Giovanni Teofilatto_, Apr 24 2015 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE