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.

A056788 a(n) = n^n + (n-1)^(n-1).

Original entry on oeis.org

2, 5, 31, 283, 3381, 49781, 870199, 17600759, 404197705, 10387420489, 295311670611, 9201412118867, 311791207040509, 11414881932150269, 449005897206417391, 18884637964090410991, 845687005960046315793, 40173648337182874339601, 2017766063735610126699403
Offset: 1

Views

Author

Walter Nissen, Aug 20 2000

Keywords

Comments

For even n > 1, the absolute value of the discriminant of the polynomial x^n+x-1. [Corrected by Artur Jasinski, May 07 2010]
The largest known prime in this sequence is a(4) = 283.

Examples

			a(3) = 2^2 + 3^3 = 4 + 27 = 31.
		

References

  • R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see equation (6.7).

Crossrefs

Cf. A000312 (n^n), A086797 (discriminant of the polynomial x^n-x-1).
Cf. A056187, A056790, A192397 (smallest & largest prime factor of a(n), records of the latter), A217435 = bigomega(a(n)).

Programs

  • Mathematica
    Join[{2}, Table[n^n+(n-1)^(n-1), {n, 2, 20}]] (* T. D. Noe, Aug 13 2004 *)
    Join[{2},Total/@Partition[Table[n^n,{n,20}],2,1]] (* Harvey P. Dale, Jun 26 2017 *)
  • PARI
    A056788(n)=n^n+(n-1)^(n-1)  \\ M. F. Hasler, Oct 02 2012

Extensions

Minor corrections by M. F. Hasler, Oct 02 2012