login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098138 a(n) = p^n + n^p where p = prime(n). 0

%I #9 Aug 26 2015 23:38:40

%S 3,17,368,18785,48989176,13065520825,232630924325880,

%T 144115205059418913,8862938121453653757392,

%U 100000000000000420707233300201,191943424957750505912623737696642,8505622499821102144582714636120669969873,4695452425098908797088972334440524350089758134

%N a(n) = p^n + n^p where p = prime(n).

%e a(1) = 2^1 + 1^2 = 3.

%e a(2) = 3^2 + 2^3 = 17.

%e a(3) = 5^3 + 3^5 = 368.

%p a:= n-> (p-> p^n+n^p)(ithprime(n)):

%p seq(a(n), n=1..15); # _Alois P. Heinz_, Aug 26 2015

%t Table[n^Prime[n] + Prime[n]^n, {n, 1, 15}] (* _Stefan Steinerberger_, Feb 28 2006 *)

%K nonn

%O 1,1

%A _Parthasarathy Nambi_, Sep 27 2004

%E More terms from _Stefan Steinerberger_, Feb 28 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)