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
2, 23, 307, 4201, 52201, 600043, 7200007, 84000023, 966000047, 10801200043, 110726400047, 1210566000001, 13200320400023, 286880405400023, 3081650404200307, 48022810241400301, 1360528840804200383 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..17.

EXAMPLE

a(4) = 4201, 1 divides 4201, 2 divides 420, 3 divides 42, 4 divides 4.

CROSSREFS

Sequence in context: A176936 A126040 A294161 * A077203 A173935 A216549

Adjacent sequences:  A088638 A088639 A088640 * A088642 A088643 A088644

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Oct 27 2003

EXTENSIONS

More terms from David Wasserman, Aug 16 2005

STATUS

approved

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 October 23 03:21 EDT 2019. Contains 328335 sequences. (Running on oeis4.)