Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135687
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135687 A sequence that depends on the sequence A004001 as: a(n)=a(n-1)-A004001(n)*a(n-2). +0
1
1, 1, -1, -3, 0, 12, 12, -36, -96, 120, 792, -48, -6384, -6000, 45072, 93072, -312576, -1243296, 2195040, 17114592, -9225888, -231715584, -102553152, 3141465024, 4679762304, -42442213056, -112638647616, 566436761280, 2368655123136, -6694333057344, -44592815027520 (list; graph; listen)
OFFSET

1,4

COMMENT

This sequence gives an alternating output.

FORMULA

a(n)=a(n-1)-A004001(n)*a(n-2)

MATHEMATICA

Clear[Conway, b, a] (*A004001*) Conway[1] = Conway[2] = 1; Conway[n_Integer?Positive] :=Conway[n] =Conway[Conway[n - 1]] + Conway[n - Conway[n - 1]]; a[1] = 1; a[2] = 1; a[n_] := a[n] = a[n - 1] - Conway[n]*a[n - 2]; Table[a[n], {n, 1, 50}]

CROSSREFS

Cf. A004001.

Sequence in context: A055314 A110890 A071534 this_sequence A057374 A058896 A008403

Adjacent sequences: A135684 A135685 A135686 this_sequence A135688 A135689 A135690

KEYWORD

uned,sign

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Feb 19 2008

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research