login
a(n+1) = a(n) + (if a(n) is odd then (next odd square) else (next even square)), a(0) = 1.
4

%I #17 Feb 13 2017 11:34:23

%S 1,10,14,30,66,130,230,374,570,826,1150,1550,2034,2610,3286,4070,4970,

%T 5994,7150,8446,9890,11490,13254,15190,17306,19610,22110,24814,27730,

%U 30866,34230,37830,41674,45770,50126,54750,59650,64834,70310,76086,82170,88570

%N a(n+1) = a(n) + (if a(n) is odd then (next odd square) else (next even square)), a(0) = 1.

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).

%F a(n+1) = A002492(n) + 10.

%F a(n) = 2*(15+n-3*n^2+2*n^3)/3 for n>0. G.f.: -(9*x^4-30*x^3+20*x^2-6*x-1) / (x-1)^4. - _Colin Barker_, Jul 18 2013

%p A116955:=n->2*(15+n-3*n^2+2*n^3)/3: 1,seq(A116955(n), n=1..60); # _Wesley Ivan Hurt_, Feb 12 2017

%t LinearRecurrence[{4,-6,4,-1},{1,10,14,30,66},50] (* _Harvey P. Dale_, Aug 21 2016 *)

%Y Cf. A002492.

%K nonn,easy

%O 0,2

%A _Reinhard Zumkeller_, Mar 15 2006

%E More terms from _Colin Barker_, Jul 18 2013