login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122582 a(n) = a(n - 1) - 2*a(n - 2) + a(n - 3) - 2*a(n - 4) + a(n - 5). 4
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; refs; listen; history; text; internal format)
OFFSET
1,7
COMMENTS
This recursion is inspired by Ulam's early experiments in derivative recursions.
LINKS
FORMULA
G.f.: x*(1+2*x^2+x^3+3*x^4)/(1-x+2*x^2-x^3+2*x^4-x^5). - R. J. Mathar, May 12 2013
MATHEMATICA
a[n_]:= a[n]= If[n<6, 1, a[n-1] -2*a[n-2] +a[n-3] -2*a[n-4] +a[n-5]];
Table[a[n], {n, 60}]
Transpose[NestList[Flatten[{Rest[#], ListCorrelate[{1, -2, 1, -2, 1}, #]}]&, {1, 1, 1, 1, 1}, 60]][[1]] (* Harvey P. Dale, Mar 21 2011 *)
PROG
(Magma) [n le 5 select 1 else Self(n-1) -2*Self(n-2) +Self(n-3) -2*Self(n-4) +Self(n-5): n in [1..50]]; // G. C. Greubel, Nov 28 2021
(Sage)
@CachedFunction # a=A122582
def a(n): return 1 if (n<6) else a(n-1) -2*a(n-2) +a(n-3) -2*a(n-4) +a(n-5)
[a(n) for n in (1..50)] # G. C. Greubel, Nov 28 2021
CROSSREFS
Sequence in context: A005474 A012264 A063198 * A173039 A016471 A324294
KEYWORD
sign
AUTHOR
Roger L. Bagula, Sep 19 2006
EXTENSIONS
Edited by N. J. A. Sloane, Oct 01 2006, Jan 01 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 23 03:01 EDT 2024. Contains 373629 sequences. (Running on oeis4.)