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 #5 Nov 21 2013 12:50:01
%S 2,7,11,43,47,61,83,97,101,151,173,223,227,241,263,277,281,313,317,
%T 331,353,367,389,421,443,457,461,547,569,601,641,673,677,691,821,853,
%U 857,907,911,997,1019,1033,1091,1123,1163,1213,1217,1231,1289,1303,1307
%N a(n)>a(n-1), a(n) = smallest prime such that a(n)+a(n-1) is multiple of m, a(1)=2, m=9.
%H Harvey P. Dale, <a href="/A175445/b175445.txt">Table of n, a(n) for n = 1..1000</a>
%t nxt[n_]:=Module[{c=NextPrime[n]},While[!Divisible[n+c,9],c= NextPrime[ c]];c]; NestList[nxt,2,60] (* _Harvey P. Dale_, Feb 18 2012 *)
%Y Cf. A175451.
%K nonn
%O 1,1
%A _Zak Seidov_, May 28 2010