Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123702
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123702 a(1)=a(2)=1. For n >= 3, a(n) = (product{k=1 to n-1} a(k)) - (sum{j=1 to n-1} a(j)). +0
2
1, 1, -1, -2, 3, 4, 18, 408, 175824, 30989858688, 960376803619751958528, 922323604960653729254933704147036248735744, 850680832267616036448642743307003648114050501920269009809993262836200003241653567488 (list; graph; listen)
OFFSET

1,4

COMMENT

a(3) and a(4) are the only negative terms of the sequence.

FORMULA

For n >= 5, a(n) = a(n-1) a(n-2) (a(n-1)-1) /(a(n-2)-1).

MATHEMATICA

f[l_List] := Append[l, Times @@ l - Plus @@ l]; Nest[f, {1, 1}, 11] (*Chandler*)

CROSSREFS

Cf. A123703.

Sequence in context: A037394 A037430 A077407 this_sequence A067805 A092837 A058772

Adjacent sequences: A123699 A123700 A123701 this_sequence A123703 A123704 A123705

KEYWORD

easy,sign

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Oct 08 2006

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 09 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 December 3 16:57 EST 2008. Contains 151279 sequences.


AT&T Labs Research