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”).
%I #10 Apr 28 2017 18:09:48
%S 1,2,3,4,10,12,14,16,18,20,22,36,39,42,45,48,51,54,57,60,63,66,69,72,
%T 75,78,81,84,87,90,124,128,132,136,140,144,148,152,156,160,164,168,
%U 172,176,180,184,188,192,196,200,204,208,212,216,220,224,228,232,236,240
%N Largest multiple of n < the n-th prime.
%H Ivan Neretin, <a href="/A076079/b076079.txt">Table of n, a(n) for n = 1..10000</a>
%p 1,seq(floor(evalf(ithprime(n)/n,100))*n,n=2..200);
%t Table[n*Quotient[Prime[n] - 1, n], {n, 60}] (* _Ivan Neretin_, Apr 27 2017 *)
%o (PARI) a(n,p=prime(n))=p-- \ n * n \\ _Charles R Greathouse IV_, Apr 28 2017
%Y Cf. A076080, A076081.
%K nonn,easy
%O 1,2
%A _Amarnath Murthy_, Oct 05 2002
%E More terms from _Sascha Kurz_, Jan 30 2003