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.

A085529 a(n) = (2n+1)^(2n+1).

Original entry on oeis.org

1, 27, 3125, 823543, 387420489, 285311670611, 302875106592253, 437893890380859375, 827240261886336764177, 1978419655660313589123979, 5842587018385982521381124421, 20880467999847912034355032910567, 88817841970012523233890533447265625, 443426488243037769948249630619149892803
Offset: 0

Views

Author

N. J. A. Sloane, Jul 05 2003

Keywords

Comments

a(n) == 2*n + 1 (mod 24). - Mathew Englander, Aug 16 2020

Crossrefs

Programs

Formula

From Mathew Englander, Aug 16 2020: (Start)
a(n) = A000312(2*n + 1).
a(n) = A016754(n)^n * (2*n + 1).
a(n) = A085527(n)^2 * (2*n + 1).
a(n) = A085528(n)^2 / (2*n + 1).
a(n) = A085530(n) * A005408(n).
a(n) = A085531(n) * A016754(n).
a(n) = A085532(n)^2 - A215265(2*n + 1).
a(n) = A085533(n) + A045531(2*n + 1).
a(n) = A085534(n+1) - A007781(2*n + 1).
a(n) = A085535(n+1) - A055869(2*n + 1).
(End)
Sum_{n>=0} 1/a(n) = (A073009 + A083648)/2 = 1.0373582538... . - Amiram Eldar, May 17 2022