Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A162852
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A162852 a(n) = 3*a(n-2) for n > 2; a(1) = 3, a(2) = -1. +0
3
3, -1, 9, -3, 27, -9, 81, -27, 243, -81, 729, -243, 2187, -729, 6561, -2187, 19683, -6561, 59049, -19683, 177147, -59049, 531441, -177147, 1594323, -531441, 4782969, -1594323, 14348907, -4782969, 43046721, -14348907, 129140163 (list; graph; listen)
OFFSET

1,1

COMMENT

Third binomial transform is A162560.

FORMULA

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

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

PROGRAM

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

CROSSREFS

Cf. A162560, A162436, A162766, A162813.

Sequence in context: A019736 A140303 A126186 this_sequence A054448 A106516 A140071

Adjacent sequences: A162849 A162850 A162851 this_sequence A162853 A162854 A162855

KEYWORD

sign

AUTHOR

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

EXTENSIONS

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

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research