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

 


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

%I #24 Sep 08 2022 08:45:54

%S 11,31,131,351,1343,2211,4931,6879,12191,24419,29823,50691,68963,

%T 79551,103871,148931,205439,227043,300831,357983,389091,493119,571871,

%U 705059,912771,1030403,1092831,1225151,1295139,1443011,2048511,2248223,2571491,2685759,3308099,3443103,3870051,4330911,4657631,5177891,5735519

%N a(n) = prime(n)^3 + prime(n) + 1.

%H Vincenzo Librandi, <a href="/A181150/b181150.txt">Table of n, a(n) for n = 1..1000</a>

%e a(4)=351 because the 4th prime is 7, and 7^3 + 7 + 1 = 351.

%p A181150 := n -> map (p -> p^(3)+p+1, ithprime(n)):

%p seq (A181150(n), n=1..41);

%t #^3+#+1&/@Prime[Range[50]] (* _Harvey P. Dale_, Jan 25 2011 *)

%o (Magma) [p^3+p+1: p in PrimesUpTo(700)]; // _Vincenzo Librandi_, Jan 26 2011

%Y Cf. A060800.

%K nonn,easy

%O 1,1

%A _Jani Melik_, Jan 24 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 20 06:55 EDT 2024. Contains 376067 sequences. (Running on oeis4.)