OFFSET
0,2
COMMENTS
The repeated substitution 0 -> {0,1,2}, 1 -> {0,1,2,3}, 2 -> {0,1}, 3 -> {0,1,2}, starting on list {0} and flattening at each step { {sequence1}, {sequence2}, ...} to {sequence1, sequence2, ...} generates a list after n steps with length = a(n). - Wouter Meeussen, Mar 06 2004
Sequence is identical to its second differences negated, minus the first 3 terms. - Paul Curtz, Feb 10 2008
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (-1,2,-1).
FORMULA
a(n) = -a(n-1) + 2*a(n-2) - a(n-3). - Paul Curtz, Feb 10 2008
MATHEMATICA
LinearRecurrence[{-1, 2, -1}, {1, -2, 4}, 41] (* G. C. Greubel, Jan 24 2023 *)
PROG
(PARI) Vec( (1-x)/(1+x-2*x^2+x^3)+O(x^99)) \\ Charles R Greathouse IV, Sep 23 2012
(PARI) my(p= Mod('x, 'x^3+'x^2-2*'x+1)); a(n) = vecsum(Vec(lift(p^(n+4)))); \\ Kevin Ryde, Jan 28 2023
(Magma) [n le 3 select (-2)^(n-1) else -Self(n-1) +2*Self(n-2) -Self(n-3): n in [1..41]]; // G. C. Greubel, Jan 24 2023
(SageMath)
@CachedFunction
def a(n): # a = A078039
if(n<3): return (1, -2, 4)[n]
else: return -a(n-1) + 2*a(n-2) - a(n-3)
[a(n) for n in range(41)] # G. C. Greubel, Jan 24 2023
CROSSREFS
KEYWORD
sign,easy
AUTHOR
N. J. A. Sloane, Nov 17 2002
STATUS
approved