|
%I #27 Feb 13 2021 14:34:12
%S 0,1,8,11,14,17,20,23,26,29,32,35,38,41,44,47,50,53,56,59,62,65,68,71,
%T 74,77,80,83,86,89,92,95,98,101,104,107,110,113,116,119,122,125,128,
%U 131,134,137,140,143,146,149,152,155,158,161,164,167,170,173,176,179
%N a(1)=0, a(2)=1, a(n)=3*n-1 for n >= 3.
%C Previous (incorrect) name was: Maximum number of lines in a game of sprouts with n initial dots. The correct formula for that name is A016789(n-1). - _Andrey Zabolotskiy_, Feb 19 2018
%D E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982, see p. 564.
%H Harvey P. Dale, <a href="/A061570/b061570.txt">Table of n, a(n) for n = 1..1000</a>
%H D. Purvis, <a href="http://www.wgosa.org/">World Game of Sprouts Association</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2, -1).
%F a(1)=0, a(2)=1, a(3)=8, a(4)=11, a(n)=2*a(n-1)-a(n-2). - _Harvey P. Dale_, Dec 12 2011
%F G.f.: x^2*(1+6*x-4*x^2)/(1-x)^2. - _Colin Barker_, Apr 12 2012
%t Join[{0,1},3*Range[2,60]+2] (* or *) Join[{0,1},LinearRecurrence[{2,-1},{8,11},60]] (* _Harvey P. Dale_, Dec 12 2011 *)
%o (GAP) Concatenation([0,1],List([3..60],n->3*n-1)); # _Muniru A Asiru_, Feb 20 2018
%o (PARI) a(n) = if(n<3, n-1, 3*n-1); \\ _Altug Alkan_, Feb 20 2018
%Y Cf. A016789.
%K easy,nonn
%O 1,3
%A Eric Shafto (eshafto(AT)mac.com), May 18 2001
%E New name from _Andrey Zabolotskiy_, Feb 19 2018
|
