|
Search: id:A129772
|
|
|
| A129772 |
|
a(0) = 1, a(1) = 2; for n>0, a(2n) = 3a(2n-1), a(2n+1) = 3a(2n) - 2a(n-1). |
|
+0
3
|
|
| 1, 2, 6, 16, 48, 140, 420, 1248, 3744, 11200, 33600, 100704, 302112, 906056, 2718168, 8153664, 24460992, 73380480, 220141440, 660416832, 1981250496, 5943729088, 17831187264, 53493494592, 160480483776, 481441249920, 1444323749760
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
MAPLE
|
a[0]:=1: a[1]:=2: for n from 2 to 30 do if n mod 2 = 0 then a[n]:=3*a[n-1] else a[n]:=3*a[n-1]-2*a[(n-3)/2] fi od: seq(a[n], n=0..30); - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 22 2007
|
|
MATHEMATICA
|
a[0] = 1; a[1] = 2; a[n_] := If[OddQ@n, 3 a[n - 1] - 2 a[(n - 3)/2], 3 a[n - 1]]; Table[ a[n], {n, 0, 26}] (* Robert G. Wilson v *)
|
|
PROGRAM
|
(PARI) {m=26; v=vector(m+1); v[1]=1; v[2]=2; for(n=2, m, k=3*v[n]; if(n%2==1, k=k-2*v[(n-1)/2]); v[n+1]=k); print(v)} /* Klaus Brockhaus, May 20 2007 */
|
|
CROSSREFS
|
Cf. A129770.
Sequence in context: A064190 A151281 A045694 this_sequence A046721 A151528 A132803
Adjacent sequences: A129769 A129770 A129771 this_sequence A129773 A129774 A129775
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Paul Curtz (bpcrtz(AT)free.fr), May 16 2007
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Robert G. Wilson v (rgwv(AT)rgwv.com) and Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 16 2007
|
|
|
Search completed in 0.002 seconds
|
