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.

A027107 a(n) = Sum_{k=0..2n} (k+1) * A027082(n, 2n-k).

Original entry on oeis.org

1, 6, 20, 62, 188, 566, 1700, 5102, 15308, 45926, 137780, 413342, 1240028, 3720086, 11160260, 33480782, 100442348, 301327046, 903981140, 2711943422, 8135830268, 24407490806, 73222472420, 219667417262, 659002251788
Offset: 0

Views

Author

Keywords

Programs

Formula

For n>0, a(n) = 7*3^(n-1) - 1.
G.f.: (1+2*x-x^2)/(1-4*x+3*x^2). [Bruno Berselli, Mar 25 2013]
a(n) = 2*A237930(n-1), n>0. - R. J. Mathar, Jun 24 2020