login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A184327 a(1)=1, a(2)=17; thereafter a(n) = 6*a(n-1)-a(n-2)+c, where c=-4 if n is odd, c=12 if n is even. 1

%I

%S 1,17,97,577,3361,19601,114241,665857,3880897,22619537,131836321,

%T 768398401,4478554081,26102926097,152139002497,886731088897,

%U 5168247530881,30122754096401,175568277047521,1023286908188737,5964153172084897,34761632124320657

%N a(1)=1, a(2)=17; thereafter a(n) = 6*a(n-1)-a(n-2)+c, where c=-4 if n is odd, c=12 if n is even.

%H Vincenzo Librandi, <a href="/A184327/b184327.txt">Table of n, a(n) for n = 1..1000</a>

%H J. V. Leyendekkers and A. G. Shannon, <a href="http://nntdm.net/volume-18-2012/number-2/58-62/">Pellian sequence relationships among pi, e, sqrt(2)</a>, Notes on Number Theory and Discrete Mathematics, Vol. 18, 2012, No. 2, 58-62. See Table 3, {y_n}.

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

%F From _Bruno Berselli_, Dec 26 2012: (Start)

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

%F a(n) = a(-n) = 6*a(n-1)-6*a(n-3)+a(n-4).

%F a(n) = ((1+sqrt(2))^(2n)+(1-sqrt(2))^(2n))/2+(-1)^n-1.

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

%t CoefficientList[Series[(1 + 11 x - 5 x^2 + x^3)/((1 - x) (1 + x) (1 - 6 x + x^2)), {x, 0, 24}], x] (* _Bruno Berselli_, Dec 26 2012 *)

%o (MAGMA) /* By definition: */ a:=[1,17]; c:=func<n | IsOdd(n) select -4 else 12>; [n le 2 select a[n] else 6*Self(n-1)-Self(n-2)+c(n): n in [1..22]]; // _Bruno Berselli_, Dec 26 2012

%K nonn,easy

%O 1,2

%A _N. J. A. Sloane_, Dec 23 2012

%E Edited from _Bruno Berselli_, Dec 26 2012

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 24 18:12 EDT 2019. Contains 326295 sequences. (Running on oeis4.)