Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122582
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122582 a(n) = a(n - 1) - 2*a(n - 2) + a(n - 3) - 2*a(n - 4) + a(n - 5). +0
2
1, 1, 1, 1, 1, -1, -3, -1, 3, 5, 3, -5, -13, -7, 13, 27, 15, -25, -61, -37, 57, 135, 81, -119, -297, -191, 257, 661, 431, -549, -1455, -991, 1169, 3225, 2257, -2497, -7115, -5145, 5299, 15725, 11715, -11261, -34709, -26623, 23829, 76603, 60479, -50361, -168997, -137173, 106105, 372655, 310905, -222951 (list; graph; listen)
OFFSET

1,7

COMMENT

This recursion is inspired by Ulam's early experiments in derivative recursions.

MATHEMATICA

a[0] = 1; a[1] = 1; a[2] = 1; a[3] = 1; a[4] = 1; a[n_] := a[n] = a[n - 1] - 2*a[n - 2] + a[n - 3] + (-2*a[n - 4] + a[n - 5]); Table[a[n], {n, 0, 30}]

CROSSREFS

Sequence in context: A005474 A012264 A063198 this_sequence A016471 A082082 A016646

Adjacent sequences: A122579 A122580 A122581 this_sequence A122583 A122584 A122585

KEYWORD

sign

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Sep 19 2006

EXTENSIONS

Edited by njas, Oct 01 2006, Jan 01 2007

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 September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research