cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A178376 A (-1,-2) Somos-4 sequence associated to the elliptic curve y^2 +y = x^3 +3*x^2 +x.

This page as a plain text file.
%I A178376 #10 Sep 08 2022 08:45:53
%S A178376 1,1,-2,-3,-5,-28,67,411,-506,10855,-74231,-664776,7518457,-30009367,
%T A178376 1791756790,22973709333,-762305126477,-10339529833556,
%U A178376 -516074985082229,-26431010871217485,1057255130388472846
%N A178376 A (-1,-2) Somos-4 sequence associated to the elliptic curve y^2 +y = x^3 +3*x^2 +x.
%C A178376 Hankel transform of the sequence with g.f. 1/(1-x^2/(1+2x^2/(1+(3/4)x^2/(1-(10/9)x^2/(1-...,
%C A178376 where -2,-3/4,10/9,... are the x-coordinates of the multiples of (0,0).
%H A178376 G. C. Greubel, <a href="/A178376/b178376.txt">Table of n, a(n) for n = 0..154</a>
%H A178376 Paul Barry, <a href="https://arxiv.org/abs/1910.00875">Generalized Catalan recurrences, Riordan arrays, elliptic curves, and orthogonal polynomials</a>, arXiv:1910.00875 [math.CO], 2019.
%F A178376 a(n) = (-a(n-1)*a(n-3) - 2*a(n-2)^2)/a(n-4), n>3.
%t A178376 RecurrenceTable[{a[n]==(-a[n-1]*a[n-3] -2*a[n-2]^2)/a[n-4], a[0] == 1, a[1] == 1, a[2] == -2, a[3] == -3}, a, {n, 0, 30}] (* _G. C. Greubel_, Sep 16 2018 *)
%o A178376 (PARI) m=30; v=concat([1,1,-2,-3], vector(m-4)); for(n=5, m, v[n] = ( -v[n-1]*v[n-3] - 2*v[n-2]^2)/v[n-4]); v \\ _G. C. Greubel_, Sep 16 2018
%o A178376 (Magma) I:=[1,1,-2,-3]; [n le 4 select I[n] else (-Self(n-1)*Self(n-3) - 2*Self(n-2)^2)/Self(n-4): n in [1..30]]; // _G. C. Greubel_, Sep 16 2018
%K A178376 easy,sign
%O A178376 0,3
%A A178376 _Paul Barry_, May 26 2010