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.

Showing 1-2 of 2 results.

A178080 Sequence with a (1,-1) Somos-4 Hankel transform.

Original entry on oeis.org

1, 0, -1, -1, -2, -6, -14, -27, -39, -4, 269, 1415, 5258, 16321, 43705, 98459, 163216, 49326, -1120684, -6502098, -25711856, -83830889, -233926105, -545916369, -932372648, -280663557, 6802456973, 40262637059, 162298734532, 538385811978
Offset: 0

Views

Author

Paul Barry, May 19 2010

Keywords

Comments

Hankel transform is A178081.

Programs

  • Mathematica
    Table[If[n == 0, 1, Sum[(Binomial[n-k, k]/(n-2*k+1))*Sum[Binomial[k, j]* Binomial[n-k-j-1, n-2*k-j]*3^(n-2*k-j)*2^j*(-1)^(k-j), {j, 0, k}], {k, 0, Floor[n/2]}] + ((1 + (-1)^n)*(-2/3)^(n/2))/2], {n, 0, 50}] (* G. C. Greubel, Sep 18 2018 *)
  • PARI
    a(n) = sum(k=0,floor(n/2), sum(j=0,k, (binomial(n-k,k)/(n-2*k+1)) *binomial(k,j)*binomial(n-k-j-1,n-2*k-j)*3^(n-2*k-j)*2^j*(-1)^(k-j)));
    for(n=0,30, print1(a(n), ", ")) \\ G. C. Greubel, Sep 18 2018

Formula

a(n) = Sum_{k=0..floor(n/2)} ( (C(n-k,k)/(n-2*k+1))*Sum_{i=0..k} C(k,i)*C(n-k-i-1,n-2*k-i)*3^(n-2k-i)*2^i*(-1)^(k-i) ).

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

Original entry on oeis.org

1, 1, -1, -4, -3, 19, 67, -40, -1243, -4299, 25627, 334324, 627929, -29742841, -372632409, 1946165680, 128948361769, 1488182579081, -52394610324649, -2333568937567764, -5642424912729707, 3857844273728205019
Offset: 1

Views

Author

Paul Barry, May 31 2010

Keywords

Comments

a(n) is (-1)^C(n,2) times the Hankel transform of the sequence with g.f.
1/(1-x^2/(1-x^2/(1-4x^2/(1+(3/16)x^2/(1-(76/9)x^2/(1-(201/361)x^2/(1-... where
1,4,-3/16,76/9,201/361,... are the x-coordinates of the multiples of z=(0,0)
on E:y^2-xy-y=x^3+x^2+x.

Crossrefs

Programs

  • Magma
    I:=[1,1,-1,-4]; [n le 4 select I[n] else (Self(n-1)*Self(n-3) + Self(n-2)^2)/Self(n-4): n in [1..30]]; // G. C. Greubel, Sep 18 2018
    
  • Mathematica
    RecurrenceTable[{a[n] == (a[n-1]*a[n-3] +a[n-2]^2)/a[n-4], a[1] == 1, a[2] == 1, a[3] == -1, a[4] == -4}, a, {n,1,30}] (* G. C. Greubel, Sep 18 2018 *)
  • PARI
    a(n)=local(E,z);E=ellinit([ -1,1,-1,1,0]);z=ellpointtoz(E,[0,0]); round(ellsigma(E,n*z)/ellsigma(E,z)^(n^2))
    
  • PARI
    m=30; v=concat([1,1,-1,-4], 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) = subst(elldivpol(ellinit([-1, 1, -1, 1, 0]), n), x ,0)}; /* Michael Somos, Jul 05 2024 */
    
  • SageMath
    @CachedFunction
    def a(n): # a = A178628
        if n<5: return (0,1,1,-1,-4)[n]
        else: return (a(n-1)*a(n-3) + a(n-2)^2)/a(n-4)
    [a(n) for n in range(1,41)] # G. C. Greubel, Jul 05 2024

Formula

a(n) = (a(n-1)*a(n-3) + a(n-2)^2)/a(n-4), n>4.
a(n) = -a(-n). a(n) = (-a(n-1)*a(n-4) +4*a(n-2)*a(n-3))/a(n-5) for all n in Z except n=5. - Michael Somos, Jul 05 2024

Extensions

Offset changed to 0. - Michael Somos, Jul 05 2024
Showing 1-2 of 2 results.