Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014983
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014983 a(n) = a(n-1) + (-3)^(n-1) = (1 - (-3)^n)/4. G.f.: x/((1-x)*(1+3*x)). +0
9
0, 1, -2, 7, -20, 61, -182, 547, -1640, 4921, -14762, 44287, -132860, 398581, -1195742, 3587227, -10761680, 32285041, -96855122, 290565367, -871696100, 2615088301, -7845264902, 23535794707, -70607384120, 211822152361, -635466457082 (list; graph; listen)
OFFSET

0,3

COMMENT

q-integers for q=-3.

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 927

R. A. Sulanke, Moments of generalized Motzkin paths, J. Integer Sequences, Vol. 3 (2000), #00.1.

FORMULA

a(n) = the (1, 2)-th element of M^n, where M = ((1, 1, 1, -2), (1, 1, -2, 1), (1, -2, 1, 1), (-2, 1, 1, 1)). - Simone Severini (ss54(AT)york.ac.uk), Nov 25 2004

PROGRAM

(PARI) a(n)=(1-(-3)^n)/4

CROSSREFS

A014983(n)=-(-1)^n*A015518(n).

Sequence in context: A116950 A111017 A116408 this_sequence A015518 A083379 A000935

Adjacent sequences: A014980 A014981 A014982 this_sequence A014984 A014985 A014986

KEYWORD

sign,easy

AUTHOR

Olivier Gerard (ogerard(AT)ext.jussieu.fr)

page 1

Search completed in 0.002 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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research