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.

Showing 1-2 of 2 results.

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

Original entry on oeis.org

-1, -1, -1, 17, 399, 7849, 162287, 3667649, 91171007, 2486784401, 74062575399, 2395420006033, 83695120256591, 3143661612445145, 126375169532421599, 5415486851106043649, 246486713303685957375, 11877172892329028459041, 604107995057426434824791
Offset: 0

Views

Author

Dennis S. Kluk (mathemagician(AT)ameritech.net)

Keywords

Comments

From Mathew Englander, Jul 07 2020: (Start)
All a(n) are odd and for n even, a(n) == 3 (mod 4); for n odd and n != 1, a(n) == 1 (mod 4).
The correspondence between n and a(n) when considered mod 6 is as follows: for n == 0, 1, 2, or 3, a(n) == 5; for n == 4, a(n) == 3; for n == 5, a(n) == 1.
For all n, a(n)+1 is a multiple of n^2.
For n odd and n >= 3, a(n)-1 is a multiple of (n+1)^2.
For n even and n >= 0, a(n)+1 is a multiple of (n+1)^2.
For proofs of the above, see the Englander link. (End)

Examples

			a(2) = 1^2 - 2^1 = -1,
a(4) = 3^4 - 4^3 = 17.
		

References

  • G. Everest, A. van der Poorten, I. Shparlinski and T. Ward, Recurrence Sequences, Amer. Math. Soc., 2003; see esp. p. 255.

Crossrefs

Programs

Formula

Asymptotic expression for a(n) is a(n) ~ n^n * (n - e). - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 19 2001
From Mathew Englander, Jul 07 2020: (Start)
a(n) = A111454(n+4) - 1.
a(n) = A055651(n, n+1).
a(n) = A220417(n+1, n) for n >= 1.
a(n) = A007778(n) - A000169(n+1).
(End)
E.g.f.: LambertW(-x)/((1+LambertW(-x))*x)-LambertW(-x)/(1+LambertW(-x))^3. - Alois P. Heinz, Jul 04 2022

A174380 Smallest prime factors of numbers of the form (n-1)^n - n^(n-1) A007925.

Original entry on oeis.org

17, 3, 47, 162287, 23, 257, 2486784401, 3, 33479, 83695120256591, 5, 67, 7, 3, 443881, 100417, 859, 79, 10745792197529, 3, 92798617729, 67, 1627, 11, 12298336501553, 3, 19, 241, 167, 3506869732968391733353, 5, 3, 47, 5, 317
Offset: 4

Views

Author

Torbjorn Alm (talm(AT)tele2.se), Mar 17 2010

Keywords

Comments

For n = 1 to 3 no prime factors in A007925(n).

Crossrefs

Programs

  • Mathematica
    Table[FactorInteger[(n-1)^n-n^(n-1)][[1,1]],{n,4,40}] (* Harvey P. Dale, May 25 2011 *)
Showing 1-2 of 2 results.