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!)
A119759 a(1) = 1; a(n) is the smallest number k larger than a(n-1) such that k*A002110(n)^3 - 1 is prime. 1

%I #9 Aug 28 2021 06:42:38

%S 1,2,4,9,15,23,30,37,41,47,49,53,57,59,66,74,76,88,95,101,158,166,170,

%T 248,332,333,358,415,433,458,461,466,479,481,572,748,812,883,901,935,

%U 981,1152,1173,1214,1409,1472,1499,1527,1596,1721,1752,1777,1892,1951,1969

%N a(1) = 1; a(n) is the smallest number k larger than a(n-1) such that k*A002110(n)^3 - 1 is prime.

%t a = {1}; For[n = 2, n < 41, n++, k = a[[ -1]] + 1; While[ !PrimeQ[ k*Product[Prime[i], {i, 1, n}]^3 - 1], k++ ]; AppendTo[a, k]]; a

%Y Cf. A002110, A119760.

%K nonn

%O 1,2

%A _Pierre CAMI_, Jun 18 2006

%E Edited by _Stefan Steinerberger_, Aug 13 2007

%E More terms from _Amiram Eldar_, Aug 28 2021

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 September 17 19:42 EDT 2024. Contains 375990 sequences. (Running on oeis4.)