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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A264897 Integers n such that A002110(n) is divisible by A098999(n). 0
 138, 163, 873, 1054, 1079, 1604, 1825, 1990, 2079, 2493, 2509, 2810, 2950, 3494, 3800, 3910, 4300, 4462, 4470, 4564, 4593, 4957, 5140, 5450, 5558, 5572, 5581, 5834, 6391, 6792, 6969, 7444, 7892, 8321, 8530, 8581, 9254, 9299, 9522, 9832, 9847, 10082, 10850 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A002110(138) has 327 digits. What is the minimum value of a(n) - a(n-1)? LINKS MATHEMATICA Select[Range@ 10000, Divisible[Product[Prime@ k, {k, #}], Sum[Prime[k]^3, {k, #}]] &] (* Michael De Vlieger, Nov 28 2015 *) PROG (PARI) for(n=1, 11000, if(prod(k=1, n, prime(k)) % sum(k=1, n, prime(k)^3) == 0, print1(n, ", "))) CROSSREFS Cf. A002110, A051838, A098999, A122137. Sequence in context: A008888 A045045 A108156 * A202441 A187206 A168531 Adjacent sequences:  A264894 A264895 A264896 * A264898 A264899 A264900 KEYWORD nonn AUTHOR Altug Alkan, Nov 27 2015 STATUS approved

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

Last modified January 22 00:08 EST 2022. Contains 350481 sequences. (Running on oeis4.)