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 #6 Dec 05 2013 19:56:35
%S 2,23,307,4201,52201,600043,7200007,84000023,966000047,10801200043,
%T 110726400047,1210566000001,13200320400023,286880405400023,
%U 3081650404200307,48022810241400301,1360528840804200383
%N Define f(k) = Floor[k/10]. Smallest prime p such that f(f(f(...r times, (p))))) is a multiple of r+1 for r = 0 to n-1.
%e a(4) = 4201, 1 divides 4201, 2 divides 420, 3 divides 42, 4 divides 4.
%K base,nonn
%O 1,1
%A _Amarnath Murthy_, Oct 27 2003
%E More terms from _David Wasserman_, Aug 16 2005