Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106539
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 1, 0, -6, -36, -192, -1104, -7248, -54816, -472512, -4573824, -49064448, -577130496, -7381281792, -101940854784, -1511556077568, -23945902043136, -403579232182272, -7209532170092544, -136064164749017088, -2705030337674674176, -56501002847058788352 (list; graph; listen)
OFFSET

1,5

COMMENT

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: A055404 A132165 A074444 this_sequence A048980 A055299 A000551

Adjacent sequences: A106536 A106537 A106538 this_sequence 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

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research