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.

A154682 (2n-1)^(2n+1) + (2n+1)^(2n-1).

Original entry on oeis.org

0, 4, 368, 94932, 45136576, 33739007300, 36314872537968, 53132088082450132, 101388548387203175168, 244552822542936127033092, 727457992333704231799337200, 2616052459228913777816325459284, 11187876119071565503348037263205568
Offset: 0

Views

Author

Avik Roy (avik_3.1416(AT)yahoo.co.in), Jan 14 2009

Keywords

Comments

All the terms are divisible by 4.
a(n) is divisible by (2n)^2 for n>0. a(n) = (2n)^2 * A233446(n) for n>0. - Alexander Adamchuk, Dec 10 2013

Crossrefs

First differences of A154569. Cf. A233446.

Formula

a(n) = (2n-1)^(2n+1) + (2n+1)^(2n-1); n>=0.