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!)
A321663 a(n) = prime(n)^prime(n+2). 0

%I #14 Jun 20 2023 15:04:54

%S 32,2187,48828125,96889010407,505447028499293771,

%T 1461920290375446110677,19967568900859523802559065713,

%U 12129821994589221844500501021364910179,1635170022196481349560959748587682926364327,1284475787728524720826927656893473276744000042113841709

%N a(n) = prime(n)^prime(n+2).

%F a(n) = prime(n)^prime(n+2).

%e a(3)=48828125 because 5 is the 3rd prime, 11 is the 5th prime and 5^11=48828125.

%t Array[Prime[#]^Prime[# + 2] &, 10] (* _Michael De Vlieger_, Nov 25 2018 *)

%t #[[1]]^#[[3]]&/@Partition[Prime[Range[20]],3,1] (* _Harvey P. Dale_, Jun 20 2023 *)

%Y Cf. A053089 (prime(n)^prime(n+1)), A000040.

%K nonn,easy

%O 1,1

%A _Kei Ryan_, Nov 16 2018

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 23 14:30 EDT 2024. Contains 371914 sequences. (Running on oeis4.)