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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A106539 a(n)=(n-1)*a(n-1)-(n-2)*a(n-2)-...-a(1). Beginning with a(0)=1, a(1)=1. 0
1, 1, 1, 0, -6, -36, -192, -1104, -7248, -54816, -472512, -4573824, -49064448, -577130496, -7381281792, -101940854784, -1511556077568, -23945902043136, -403579232182272, -7209532170092544, -136064164749017088, -2705030337674674176, -56501002847058788352 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

COMMENTS

Beginning with 0, 1, gives then 2, 4, 8, 16,... 2^(n-2)

EXAMPLE

a(7)=6*(-36)-5(-6)-4*0-3*1-2*1-1*1=-216+30-0-3-2-1=-192

MAPLE

a[0]:=1: a[1]:=1: for n from 2 to 24 do a[n]:=(n-1)*a[n-1]-add(k*a[k], k=1..n-2) od: seq(a[n], n=1..24); (Deutsch)

CROSSREFS

Cf. A001571.

Sequence in context: A074444 A146883 A159721 * A048980 A055299 A000551

Adjacent sequences:  A106536 A106537 A106538 * A106540 A106541 A106542

KEYWORD

easy,sign

AUTHOR

Alexandre Wajnberg (alexandre.wajnberg(AT)ulb.ac.be), May 08 2005

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 03 2006

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 18 00:14 EST 2012. Contains 206085 sequences.