login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137495 a(n) = A098601(2n) + A098601(2n+1). 0

%I #16 Apr 16 2023 13:38:50

%S 2,3,4,7,13,23,40,70,123,216,379,665,1167,2048,3594,6307,11068,19423,

%T 34085,59815,104968,184206,323259,567280,995507,1746993,3065759,

%U 5380032,9441298,16568323,29075380,51023735,89540413,157132471,275748264,483904470,849193147,1490230088

%N a(n) = A098601(2n) + A098601(2n+1).

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

%F a(3n) = A135364(2n+1). a(3n+1) = A137584(2n+1). a(3n+2) = A137531(2n+2).

%F From _R. J. Mathar_, Jul 06 2011: (Start)

%F G.f.: ( -2+x ) / ( -1+2*x-x^2+x^3 ).

%F a(n) = 2*A005314(n+1) - A005314(n). (End)

%o (PARI) Vec((x-2)/(-1+2*x-x^2+x^3)+O(x^99)) \\ _Charles R Greathouse IV_, Jul 06 2011

%Y Cf. A005314, A135364, A137584, A137531.

%K nonn,easy

%O 0,1

%A _Paul Curtz_, Apr 27 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:23 EDT 2024. Contains 371989 sequences. (Running on oeis4.)