|
Search: id:A088641
|
|
|
| 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
1
|
|
| 2, 23, 307, 4201, 52201, 600043, 7200007, 84000023, 966000047, 10801200043, 110726400047, 1210566000001, 13200320400023, 286880405400023, 3081650404200307, 48022810241400301, 1360528840804200383
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(4) = 4201, 1 divides 4201, 2 divides 420, 3 divides 42, 4 divides 4.
|
|
CROSSREFS
|
Sequence in context: A083470 A064110 A126040 this_sequence A013526 A091693 A060941
Adjacent sequences: A088638 A088639 A088640 this_sequence A088642 A088643 A088644
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 27 2003
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Aug 16 2005
|
|
|
Search completed in 0.002 seconds
|
