The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275571 Incorrect duplicate of A004146. 0


%S 1,5,8,45,121,320,841,2205,5776,15125,39601,103680,271441,710645,

%T 1860496,4870845,12752041,33385280,87403801,228826125,599074576,

%U 1568397605,4106118241,10749957120,28143753121,73681302245,192900153616,505019158605,1322157322201

%N Incorrect duplicate of A004146.

%C a(3) should be 16, not 8.

%C 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.

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

%K dead

%O 1,2

%A _He Wenyang_, Aug 02 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 21:48 EST 2020. Contains 338896 sequences. (Running on oeis4.)