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.

A171424 (n-1)^(p-n+1)+n where p is the smallest prime > n-1.

Original entry on oeis.org

1, 3, 5, 13, 9, 31, 13, 2409, 521, 91, 21, 133, 25, 28575, 2759, 241, 33, 307, 37, 130341, 8021, 463, 45, 148035913, 7962649, 390651, 17603, 757, 57, 871, 61, 887503713, 33554465, 1185955, 39339, 1261, 73, 1874199, 54911, 1561, 81, 1723, 85, 3418845
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Dec 09 2009

Keywords

Examples

			a(1)=(1-1)^(2-1+1)+1=1, a(2)=(2-1)^(2-2+1)+2=3, a(3)=(3-1)^(3-3+1)+3=5.
		

Crossrefs

Formula

a(n)=A171228(n)+A000027(n).

Extensions

Definition and examples corrected by R. J. Mathar, May 22 2010

A171240 a(n) = n^d+d^n where d = A013632(n) is the distance to the next prime.

Original entry on oeis.org

2, 3, 17, 5, 57, 7, 18785, 7073, 593, 11, 2169, 13, 67137425, 4785713, 32993, 17, 131361, 19, 274878037265, 3486792401, 2097593, 23, 789730223201638705, 59604644783353249, 1125899907233249, 2541865845905, 134218457, 29, 536871753, 31
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Dec 05 2009

Keywords

Crossrefs

Programs

  • Mathematica
    dnp[n_]:=Module[{d=NextPrime[n]-n},n^d+d^n]; Array[dnp,20](* Harvey P. Dale, Jun 23 2017 *)

Extensions

Definition and some values corrected - R. J. Mathar, Jun 04 2010
More terms from Harvey P. Dale, Jun 23 2017
Showing 1-2 of 2 results.