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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A154232 List of pairs: sum and product recursions:{a(n),b(n)}; a(n)=(n^2-n-1)+a(n-1); b(n)=(n^2-n-1)*b(n-1). 0
0, 1, -1, -1, 0, -1, 5, -5, 16, -55, 35, -1045, 64, -30305, 105, -1242505, 160, -68337775, 231, -4851982025, 320, -431826400225, 429, -47069077624525, 560, -6166049168812775, 715, -955737621165980125, 896, -172988509431042402625 (list; graph; refs; listen; history; internal format)
OFFSET

0,7

FORMULA

a(n)=(n^2-n-1)+a(n-1); b(n)=(n^2-n-1)*b(n-1).

MATHEMATICA

Clear[a, b, n]; a[0] = 0; a[n_] := a[n] = n^2 - n - 1 + a[n - 1];

b[0] = 1; b[n_] := b[n] = (n^2 - n - 1)*b[n - 1];

Flatten[Table[{a[n], b[n]}, {n, 0, 15}]]

CROSSREFS

Sequence in context: A178821 A145599 A189316 * A194615 A195465 A173464

Adjacent sequences:  A154229 A154230 A154231 * A154233 A154234 A154235

KEYWORD

sign,uned,tabf

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 05 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 14 08:39 EST 2012. Contains 205614 sequences.