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: He Wenyang

He Wenyang's wiki page.

He Wenyang has authored 1 sequences.

A275571 Incorrect duplicate of A004146.

Original entry on oeis.org

1, 5, 8, 45, 121, 320, 841, 2205, 5776, 15125, 39601, 103680, 271441, 710645, 1860496, 4870845, 12752041, 33385280, 87403801, 228826125, 599074576, 1568397605, 4106118241, 10749957120, 28143753121, 73681302245, 192900153616, 505019158605, 1322157322201
Offset: 1

Views

Author

He Wenyang, Aug 02 2016

Keywords

Comments

a(3) should be 16, not 8.
Previous name was: Number of spanning trees in the wheel graph G consisting of an n-cycle with a central vertex connected to each vertex of the cycle.

Formula

a(n) = Sum_{i=1..n-1} ( Fibonacci(2n-2i)*i^2 ) + n^2.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.