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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A162766 a(n) = 3*a(n-2) for n > 2; a(1) = 4, a(2) = 3. 8
4, 3, 12, 9, 36, 27, 108, 81, 324, 243, 972, 729, 2916, 2187, 8748, 6561, 26244, 19683, 78732, 59049, 236196, 177147, 708588, 531441, 2125764, 1594323, 6377292, 4782969, 19131876, 14348907, 57395628, 43046721, 172186884, 129140163 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Apparently a(n) = A074324(n+1).

Binomial transform is A162559. Second binomial transform is A077236.

FORMULA

a(n) = (5-3*(-1)^n)*3^(1/4*(2*n-1+(-1)^n))/2.

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

PROG

(MAGMA) [ n le 2 select 5-n else 3*Self(n-2): n in [1..34] ];

CROSSREFS

Cf. A074324, A162559, A077236, A162436.

Sequence in context: A168430 A074324 * A166552 A122804 A122544 A205371

Adjacent sequences:  A162763 A162764 A162765 * A162767 A162768 A162769

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jul 13 2009

EXTENSIONS

G.f. corrected by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Sep 18 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 12:30 EST 2012. Contains 206014 sequences.