login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

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

%I #39 Feb 23 2024 07:26:22

%S 2,3,7,23,47,283,719,1439,2879,34549,138197,1266767,14619833,36449279,

%T 377982107,1432349099,22111003847

%N 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.

%C 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 Erdős-Selfridge classification of primes).

%C From _David A. Corneth_, Oct 18 2016 (Start):

%C If a(n) * k + 1 is prime then a(n + 1) <= a(n) * k + 1.

%C a(18), a(19), ..., a(23) <= 309554053859, 619108107719, 19811459447009, 433142367554861, 866284735109723, 22523403112852799 respectively. (End)

%D Steven G. Johnson, Postings to Number Theory List, Apr 23 and Apr 25, 2003.

%e a(2) = 7 since 7 -> 3 -> 2 takes two steps, and smaller primes require less than 2 steps.

%e For p = 2879, 8 steps are needed (2879 -> 1439 -> 719 -> 359 -> 179 -> 89 -> 11 -> 5 -> 2), so a(8) = 2879, since smaller primes require less than 8 steps.

%t (* Assuming a(n) > 2 a(n-1) if n>1 *) Clear[a, f]; f[p_] := FactorInteger[p - 1][[-1, 1]]; f[2] = 2; a[n_] := a[n] = For[p = NextPrime[2 a[n-1]], True, p = NextPrime[p], k = 0; If[Length[FixedPointList[f, p]] == n+2, Return[p]]]; a[0]=2; a[1]=3; Table[Print[a[n]]; a[n], {n, 0, 16}] (* _Jean-François Alcover_, Oct 18 2016 *)

%Y Cf. A006530, A023503, A083647, A056637, A083647.

%K nonn,more

%O 0,1

%A _N. J. A. Sloane_, Apr 25 2003

%E Edited by _Klaus Brockhaus_, May 01 2003

%E a(16) from _Donovan Johnson_, Nov 17 2008

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 14:02 EDT 2024. Contains 371254 sequences. (Running on oeis4.)