login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = A174618(n) + A174618(n+1).
0

%I #19 Apr 08 2024 15:44:38

%S 1,1,1,2,2,3,3,4,5,6,8,10,13,17,21,28,34,45,55,72,89,116,144,188,233,

%T 305,377,494,610,799,987,1292,1597,2090,2584,3382,4181,5473,6765,8856,

%U 10946,14329,17711,23184,28657,37512,46368,60696,75025,98209,121393,158906,196418,257115,317811

%N a(n) = A174618(n) + A174618(n+1).

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

%F a(2n) = A024490(n+1). a(2n+1)= A000045(n+1).

%F a(n) = 2*a(n-2) -a(n-4) +a(n-8). G.f.: -x*(1+x)*(x^3-x^2+1) / ( (x^4-x^2+1)*(x^4+x^2-1) ). - _R. J. Mathar_, Jan 27 2011

%t LinearRecurrence[{0,2,0,-1,0,0,0,1},{1,1,1,2,2,3,3,4},60] (* _Harvey P. Dale_, Sep 09 2022 *)

%Y Cf. A024490, A000045.

%K nonn,easy

%O 1,4

%A _Mark Dols_, Mar 23 2010