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.

User: Ocean Wong

Ocean Wong's wiki page.

Ocean Wong has authored 1 sequences.

A379745 a(n) = Sum_{k=1..n-1} binomial(n, k)*2^(n-k-1)*(k-1).

Original entry on oeis.org

0, 0, 3, 20, 95, 394, 1519, 5592, 19935, 69398, 237215, 799204, 2661295, 8776962, 28714191, 93300656, 301392575, 968682286, 3099626047, 9879746748, 31382108175, 99375452570, 313814790383, 988511766280, 3106741678495, 9743852563014, 30502457048799, 95320102780052, 297398570349935, 926510631296818, 2882476923066895, 8956266393600864, 27795307127744895, 86165447371545182, 266834924374534271
Offset: 1

Author

Ocean Wong, Jan 01 2025

Keywords

Programs

  • Mathematica
    LinearRecurrence[{10,-38,68,-57,18},{0,0,3,20,95},35] (* James C. McMahon, Jan 07 2025 *)

Formula

a(n) = (3^(n-1)-1)*(n-3)/2 + 2^(n-1) - 1.