A075340 - cp's OEIS frontend

A075340 a(1) = 1; a(2n) is the smallest prime == 1 mod (a(2n-1)) and a(2n+1) is the smallest composite number == 1 (mod a(2n)).

%I A075340 #4 Dec 05 2013 19:55:37
%S A075340 1,2,9,19,20,41,42,43,44,89,90,181,182,547,548,1097,1098,7687,7688,
%T A075340 15377,15378,30757,30758,276823,276824,553649,553650,2768251,2768252,
%U A075340 8304757,8304758,99657097,99657098,199314197,199314198,3189027169
%N A075340 a(1) = 1; a(2n) is the smallest prime == 1 mod (a(2n-1)) and a(2n+1) is the smallest composite number == 1 (mod a(2n)).
%Y A075340 Cf. A075341.
%K A075340 nonn
%O A075340 1,2
%A A075340 _Amarnath Murthy_, Sep 18 2002
%E A075340 More terms from _David Wasserman_, Jan 16 2005

cp's OEIS Frontend

A075340 a(1) = 1; a(2n) is the smallest prime == 1 mod (a(2n-1)) and a(2n+1) is the smallest composite number == 1 (mod a(2n)).