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.

A374654 a(n) = Product_{k=0..n} L(k)+1, where L=A000032 (Lucas numbers).

Original entry on oeis.org

3, 6, 24, 120, 960, 11520, 218880, 6566400, 315187200, 24269414400, 3009407385600, 601881477120000, 194407717109760000, 101480828331294720000, 85649819111612743680000, 116912003087351395123200000, 258141702816871880432025600000
Offset: 0

Views

Author

Clark Kimberling, Jul 25 2024

Keywords

Crossrefs

Programs

  • Mathematica
    w[n_] := Product[LucasL[k] + 1, {k, 0, n}]
    Table[w[n], {n, 0, 20}]

Formula

a(n) = Product_{k=0..n} L(k)+1, where L=A000032 (Lucas numbers).

A374857 Obverse convolution (n)**(Fibonacci(n)); see Comments.

Original entry on oeis.org

0, 1, 4, 36, 432, 8000, 216000, 8668296, 516311040, 46066268160, 6197083200000, 1266665976576000, 396044443339776000, 190620194701725734400, 142017680690039344619520, 164583068009095149120000000, 297947499870194922871259136000
Offset: 0

Views

Author

Clark Kimberling, Aug 05 2024

Keywords

Comments

See A374848 for the definition of obverse convolution and a guide to related sequences.

Crossrefs

Programs

  • Mathematica
    s[n_] := n; t[n_] := Fibonacci[n];
    u[n_] := Product[s[k] + t[n - k], {k, 0, n}]
    Table[u[n], {n, 0, 20}]
Showing 1-2 of 2 results.