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.

A061600 a(n) = n^3 - n + 1.

Original entry on oeis.org

1, 1, 7, 25, 61, 121, 211, 337, 505, 721, 991, 1321, 1717, 2185, 2731, 3361, 4081, 4897, 5815, 6841, 7981, 9241, 10627, 12145, 13801, 15601, 17551, 19657, 21925, 24361, 26971, 29761, 32737, 35905, 39271, 42841, 46621, 50617, 54835, 59281, 63961
Offset: 0

Views

Author

Amarnath Murthy, May 19 2001

Keywords

Comments

Smallest of n consecutive odd numbers whose sum is n^4. (n^k can be expressed as the sum of n consecutive odd numbers the smallest of which is given by n^(k-1)-n+1.)

Examples

			a(5) = 121 = 5^3 - 5 + 1. We have 121 + 123 + 125 + 127 + 129 = 625 = 5^4.
		

References

  • T. A. Gulliver, Sequences from Cubes of Integers, Int. Math. Journal, 4 (2003), 439-445.

Crossrefs

Cf. A126420.

Programs

Formula

G.f.: (1-3*x+9*x^2-x^3)/(1 - x)^4. a(-n) = -A126420(n). - Bruno Berselli, Aug 29 2011
a(n) = 1 + Sum_{k=1..n} 3*(k-1)*k. - Luce ETIENNE and Michel Marcus, Nov 01 2014
E.g.f.: exp(x)*(1 + 3*x^2 + x^3). - Nikolaos Pantelidis, Feb 13 2023

Extensions

Offset changed from 1 to 0 by Harry J. Smith, Jul 25 2009