A321663 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A321663

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

32, 2187, 48828125, 96889010407, 505447028499293771, 1461920290375446110677, 19967568900859523802559065713, 12129821994589221844500501021364910179, 1635170022196481349560959748587682926364327, 1284475787728524720826927656893473276744000042113841709

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Table of n, a(n) for n=1..10.

FORMULA

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

EXAMPLE

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

MATHEMATICA

Array[Prime[#]^Prime[# + 2] &, 10] (* Michael De Vlieger, Nov 25 2018 *)

#[[1]]^#[[3]]&/@Partition[Prime[Range[20]], 3, 1] (* Harvey P. Dale, Jun 20 2023 *)

CROSSREFS

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

Sequence in context: A085526 A376523 A101441 * A264145 A180954 A220730

Adjacent sequences: A321660 A321661 A321662 * A321664 A321665 A321666

KEYWORD

nonn,easy

AUTHOR

Kei Ryan, Nov 16 2018

STATUS

approved