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!)
A168321 a(n) = n +6 - a(n-1), with a(1) = 0. 1

%I #14 Sep 08 2022 08:45:49

%S 0,8,1,9,2,10,3,11,4,12,5,13,6,14,7,15,8,16,9,17,10,18,11,19,12,20,13,

%T 21,14,22,15,23,16,24,17,25,18,26,19,27,20,28,21,29,22,30,23,31,24,32,

%U 25,33,26,34,27,35,28,36,29,37,30,38,31,39,32,40,33,41,34,42,35,43,36

%N a(n) = n +6 - a(n-1), with a(1) = 0.

%H G. C. Greubel, <a href="/A168321/b168321.txt">Table of n, a(n) for n = 1..1000</a>

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

%F From _R. J. Mathar_, Nov 23 2009: (Start)

%F a(n) = a(n-1) + a(n-2) - a(n-3).

%F a(n) = (13 + 15*(-1)^n + 2*n)/4.

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

%F E.g.f.: (1/4)*(15 - 28*exp(x) + (13 + 2*x)*exp(2*x))*exp(-x). - _G. C. Greubel_, Jul 17 2016

%t a=7; Table[a=n-a,{n,a,200}]

%t LinearRecurrence[{1,1,-1},{0,8,1},50] (* _G. C. Greubel_, Jul 17 2016 *)

%o (Magma) [(13+15*(-1)^n+2*n)/4: n in [1..80]]; // _Vincenzo Librandi_, Jul 18 2016

%K nonn,less

%O 1,2

%A _Vladimir Joseph Stephan Orlovsky_, Nov 22 2009

%E NAME adapted to offset. - _R. J. Mathar_, Jun 19 2021

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 March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)