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.

A027008 a(n) = greatest number in row n of array T given by A026998.

Original entry on oeis.org

1, 1, 4, 8, 13, 26, 54, 101, 174, 370, 743, 1397, 2552, 5353, 10636, 20120, 38138, 78753, 155793, 296248, 573382, 1173183, 2316317, 4423690, 8673078, 17641499, 34801731, 66705394, 131894869, 267203186, 526966454, 1013155981
Offset: 0

Views

Author

Keywords

Crossrefs

Cf. A026998.

Programs

  • Mathematica
    f[n_, k_]:= f[n, k]= Sum[Binomial[2*n-k+j,j]*LucasL[2*(k-n-j)], {j,0,k-n-1}];
    A027960[n_, k_]:= LucasL[k+1] -f[n,k]*Boole[k>n];
    b[n_]:= b[n]= Table[A027960[n,2*k], {k,0,n}];
    A027008[n_]:= Max[b[n]];
    Table[A027008[n], {n,0,50}] (* G. C. Greubel, Jul 24 2025 *)
  • SageMath
    @CachedFunction
    def t(n, k): # t = A027960
        if (k>2*n): return 0
        elif (kA026998(n, k): return t(n, 2*k)
    def b(n): return flatten([A026998(n,k) for k in range(n+1)])
    def A027008(n): return max(b(n))
    print([A027008(n) for n in range(51)]) # G. C. Greubel, Jul 24 2025

Extensions

Offset changed by G. C. Greubel, Jul 24 2025