login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088641 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. 0

%I

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 19:48 EST 2019. Contains 329288 sequences. (Running on oeis4.)