OFFSET
0,4
COMMENTS
Hankel transform of the sequence with g.f. 1/(1-x^2/(1-x^2/(1-3x^2/(1+(2/9)x^2/(1-(33/4)x^2/(1-...)))))) where 1,3,-2/9,33/4,... are the x-coordinates of the multiples of (0,0).
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 0..150
Paul Barry, Generalized Catalan recurrences, Riordan arrays, elliptic curves, and orthogonal polynomials, arXiv:1910.00875 [math.CO], 2019.
FORMULA
a(n) = (-a(n-1)*a(n-3)+a(n-2)^2)/a(n-4), n>3.
From Michael Somos, Jan 11 2015: (Start)
a(n) = (-1)^n * a(-2-n) for all n in Z.
0 = a(n)*a(n+4) + a(n+1)*a(n+3) - a(n+2)*a(n+2) for all n in Z.
0 = a(n)*a(n+5) + a(n+1)*a(n+4) - 3*a(n+2)*a(n+3) for all n in Z. (End)
MATHEMATICA
RecurrenceTable[{a[n] == (-a[n-1]*a[n-3] +a[n-2]^2)/a[n-4], a[0] == 1, a[1] == 1, a[2] == 1, a[3] == 3}, a, {n, 0, 30}] (* G. C. Greubel, Sep 18 2018 *)
PROG
(Haskell)
a178384 n = a178384_list !! n
a178384_list = [1, 1, 1, 3] ++
zipWith div (foldr1 (zipWith subtract) (map b [1..2])) a178384_list
where b i = zipWith (*) (drop i a178384_list) (drop (4-i) a178384_list)
-- Reinhard Zumkeller, Sep 15 2014
(Magma) I:=[1, 1, 1, 3]; [n le 4 select I[n] else (-Self(n-1)*Self(n-3)+Self(n-2)^2)/Self(n-4): n in [1..30]]; // Vincenzo Librandi, Jun 24 2015
(PARI) m=30; v=concat([1, 1, 1, 3], vector(m-4)); for(n=5, m, v[n] = (-v[n-1]*v[n-3] + v[n-2]^2)/v[n-4]); v \\ G. C. Greubel, Sep 18 2018
(PARI) {a(n) = n++; sign(n) * (-1)^(n\2+n+1) * subst( elldivpol( ellinit([0, 0, 1, 1, 0]), abs(n)), x, 0)}; /* Michael Somos, Sep 14 2024 */
CROSSREFS
KEYWORD
easy,sign
AUTHOR
Paul Barry, May 26 2010
STATUS
approved