login

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”).

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

%I #8 Dec 05 2013 19:55:37

%S 1,4,5,6,7,8,17,18,19,20,41,42,43,44,89,90,181,182,547,548,1097,1098,

%T 7687,7688,15377,15378,30757,30758,276823,276824,553649,553650,

%U 2768251,2768252,8304757,8304758,99657097,99657098,199314197,199314198

%N a(1) = 1, a(2n) is the smallest composite number == 1 mod (a(2n-1)) and a(2n+1) is the smallest prime == 1 (mod a(2n)).

%C a(k) = b(k-5) for k > 8 where b(r) is the r-th term of A075340.

%t a[1] = 1; a[2] = 4; a[n_] := a[n] = Block[{k = a[n - 1] + 1, m = a[n - 1]}, If[OddQ@n, While[ !PrimeQ@k || Mod[k, m] != 1, k += m]; k, While[PrimeQ@k || Mod[k, m] != 1, k += m]; k]]; Array[a, 40] (* _Robert G. Wilson v_ Sep 21 2006 *)

%Y Cf. A075340.

%Y See also: Always look for prime: A061092. Always look for composite: A061766.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Sep 18 2002

%E More terms from _David Wasserman_, Jan 16 2005