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.

Links

Crossrefs

Cf. A051442.
Cf. A166326, A099498, A141074, A174379, A123206, A045575, A082754.

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

A123206 Primes of the form x^y - y^x, for x,y > 1.

Original entry on oeis.org

7, 17, 79, 431, 58049, 130783, 162287, 523927, 2486784401, 6102977801, 8375575711, 13055867207, 83695120256591, 375700268413577, 2251799813682647, 9007199254738183, 79792265017612001, 1490116119372884249
Offset: 1

Views

Author

Alexander Adamchuk, Oct 04 2006

Keywords

Comments

These are the primes in A045575, numbers of the form x^y - y^x, for x,y > 1. This includes all primes from A122735, smallest prime of the form (n^k - k^n) for k>1.
If y=1 was allowed, any prime p could be obtained for x=p+1. This motivates to consider sequence A243100 of primes of the form x^(y+1)-y^x. - M. F. Hasler, Aug 19 2014

Examples

			The primes 6102977801 and 1490116119372884249 are of the form 5^y-y^5 (for y=14 and y=26) and therefore members of this sequence. The next larger primes of this form would have y > 4500 and would be much too large to be included. - _M. F. Hasler_, Aug 19 2014

Links

Crossrefs

Cf. A045575, A122735, A078202, A082754, A055651, A094133.
A163319 is the subsequences for fixed x=3, A243114 for x=6.
Cf. A072180, A109387, A117705, A117706, A128447, A128449, A128450, A128451, A122003, A128453, A128454.

Programs

  • Maple
    N:= 10^100: # to get all terms <= N
A:= NULL:
for x from 2 while x^(x+1) - (x+1)^x <= N do
   for y from x+1 do
      z:= x^y - y^x;
      if z > N then break
      elif z > 0 and isprime(z) then A:=A, z;
      fi
od od:
{A}; # Robert Israel, Aug 29 2014
  • Mathematica
    Take[Select[Intersection[Flatten[Table[Abs[x^y-y^x],{x,2,120},{y,2,120}]]],PrimeQ[ # ]&],25]
nn=10^50; n=1; t=Union[Reap[While[n++; k=n+1; num=Abs[n^k-k^n]; num0&&PrimeQ[#]&]],nn]] (* Harvey P. Dale, Nov 23 2013 *)
  • PARI
    a=[];for(S=1,199,for(x=2,S-2,ispseudoprime(p=x^(y=S-x)-y^x)&&a=concat(a,p)));Set(a) \\ May be incomplete in the upper range of values, i.e., beyond a given S=x+y, a larger S may yield a smaller prime (for small x). - M. F. Hasler, Aug 19 2014
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.