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 #11 Jun 20 2017 10:59:39
%S 2,5,13,29,61,491,3931,15727,157273,314549,4403689,17614759,387524701,
%T 5425345817,119357607977,9787323854117,78298590832939,
%U 1722568998324661,68902759932986443,4685387675443078127,318606361930129312639,637212723860258625281
%N a(1)=2; a(n) is smallest prime of the form k*a(n-1) + 3, k>0.
%H Robert Israel, <a href="/A214633/b214633.txt">Table of n, a(n) for n = 1..391</a>
%p A214633 := proc(n)
%p option remember;
%p local k;
%p if n = 1 then
%p 2;
%p else
%p for k from 1 do
%p if isprime(k*procname(n-1)+3) then
%p return k*procname(n-1)+3 ;
%p end if;
%p end do:
%p end if;
%p end proc:
%p seq(A214633(n),n=1..20) ; # _R. J. Mathar_, Jul 23 2012
%Y Cf. A061092, A059411, A214523, A214632.
%K nonn
%O 1,1
%A _Robin Garcia_, Jul 23 2012