This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055463 a(n) = a(n-1)*2*a(n-2)-3*a(n-3). 1
 0, 1, 2, 4, 13, 98, 2536, 497017, 2520869930, 2505830419990012, 12633745110864184300787269, 63316045634407119326463714272245870904666, 1599837563945889048330164752080268110156603845860584259478831024272 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(3*n+1) == 1 (mod 12), a(3*n+2) == 2 (mod 12), a(3*n+3) == 4 (mod 12). - Robert Israel, Jan 18 2018 LINKS Robert Israel, Table of n, a(n) for n = 0..17 MAPLE A[0]:= 0: A[1]:= 1: A[2]:= 2: for n from 3 to 17 do A[n]:= A[n-1]*2*A[n-2]-3*A[n-3] od: seq(A[i], i=0..17); # Robert Israel, Jan 18 2018 CROSSREFS Sequence in context: A306445 A216670 A103845 * A091957 A327443 A056678 Adjacent sequences:  A055460 A055461 A055462 * A055464 A055465 A055466 KEYWORD easy,nonn AUTHOR Robert G. Wilson v, Jul 05 2000 STATUS approved

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.

Last modified September 22 17:04 EDT 2019. Contains 327311 sequences. (Running on oeis4.)