|
Search: id:A082449
|
|
|
| A082449 |
|
Let f(p) = greatest prime divisor of p-1. Sequence gives smallest prime which takes at least n steps to reach 2 when f is iterated. |
|
+0
4
|
|
| 2, 3, 7, 23, 47, 283, 719, 1439, 2879, 34549, 138197, 1266767, 14619833, 36449279, 377982107, 1432349099
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
There is a remarkable and unexplained agreement: if 3 and 7 are replaced by 11 and 14619833 is replaced by 14920303, the result is sequence A056637 (least prime of class n-, according to the Erdos-Selfridge classification of primes).
|
|
REFERENCES
|
Steven G. Johnson, Postings to Number Theory List, Apr 23 and Apr 25, 2003.
|
|
EXAMPLE
|
a(2) = 7 since 7 -> 3 -> 2 takes two steps; for p = 2879, 8 steps are needed (2879 -> 1439 -> 719 -> 359 -> 179 -> 89 -> 11 -> 5 -> 2), so a(8) = 2879; smaller primes require less than 2 resp. 8 steps.
|
|
CROSSREFS
|
Cf. A006530, A023503, A083647, A056637, A083647.
Sequence in context: A106865 A000057 A037231 this_sequence A129741 A006720 A084710
Adjacent sequences: A082446 A082447 A082448 this_sequence A082450 A082451 A082452
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
njas, Apr 25 2003
|
|
EXTENSIONS
|
Edited by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 01 2003
|
|
|
Search completed in 0.002 seconds
|
