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(n) = smallest number == 1 mod (a(n-1)) and > 1 such that every concatenation (n>1) is prime.
1

%I #4 Dec 05 2013 19:56:33

%S 1,3,7,29,117,1639,45893,734289,54337387,434699097

%N a(1) = 1, a(n) = smallest number == 1 mod (a(n-1)) and > 1 such that every concatenation (n>1) is prime.

%Y Cf. A088096.

%K base,fini,full,nonn

%O 1,2

%A _Amarnath Murthy_, Sep 24 2003

%E More terms from _David Wasserman_, Jul 19 2005