cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A174741 a(n) = smallest m > 0 such that there are no primes between p*m and p*(m+1) inclusive where p is the n-th prime.

This page as a plain text file.
%I A174741 #3 Mar 30 2012 19:00:43
%S A174741 4,8,18,17,29,87,79,70,58,292,506,424,766,937,542,2026,1820,2842,4960,
%T A174741 5215,2136,4687,4461,12809,13992,3666,16231,17662,17338,41935,60010,
%U A174741 46063,61469,144060,114441,137956,293037,290348,443629,457617,264395
%N A174741 a(n) = smallest m > 0 such that there are no primes between p*m and p*(m+1) inclusive where p is the n-th prime.
%p A174741 a:=proc(n) local m,p; p:=ithprime(n); for m from 2 do if nextprime(p*m)>p*(m+1) then return m; fi; od: end proc:
%Y A174741 Cf. A110835
%K A174741 hard,nonn
%O A174741 1,1
%A A174741 _W. Edwin Clark_, Mar 29 2010
%E A174741 Terms from a(37) on from _R. J. Mathar_, Apr 15 2010