OFFSET
1,1
COMMENTS
Conjecture: a(n) is never equal to -1.
For any n, the iteration of gpf(6*n+1) results in a cycle with a smallest term of 13 or 47.
Cycle 13: 79, 19, 23, 139, 167, 59, 71, 61, 367, 2203, 13219, 547, 67, 31, 17, 103, 619, 743, 13. (19 terms)
Cycle 47: 283, 1699, 2039, 2447, 14683, 8009, 1373, 107, 643, 227, 47. (11 terms)
LINKS
Paolo Xausa, Table of n, a(n) for n = 1..10000
EXAMPLE
Irregular array n\ iterations gpf(6*n+1):
1: 7, 43, 37, 223, 103, 619, 743, 13, so a(1) = 8.
2: 13, so a(2) = 1.
3: 19, 23, 139, 167, 59, 71, 61, 367, 2203, 13219, 547, 67, 31, 17, 103, 619, 743, 13, so a(3) = 18.
4: 5, 31, 17, 103, 619, 743, 13, so a(4) = 7.
5: 31, 17, 103, 619, 743, 13, so a(5) = 6.
6: 37, 223, 103, 619, 743, 13, so a(6) = 6.
7: 43, 37, 223, 103, 619, 743, 13, so a(7) = 7.
8: 7, 43, 37, 223, 103, 619, 743, 13, so a(8) = 8.
9: 11, 67, 31, 17, 103, 619, 743, 13, so a(9) = 8.
10: 61, 367, 2203, 13219, 547, 67, 31, 17, 103, 619, 743, 13, so a(10) = 12.
11: 67, 31, 17, 103, 619, 743, 13, so a(11) = 7.
12: 73, 439, 31, 17, 103, 619, 743, 13, so a(12) = 8.
13: already 13, so a(13) = 0.
14: 17, 103, 619, 743, 13, so a(14) = 5.
15: 13, so a(15) = 1.
16: 97, 53, 29, 7, 43, 37, 223, 103, 619, 743, 13, so a(16) = 11.
MATHEMATICA
A392329[n_] := Length[NestWhileList[FactorInteger[6*# + 1][[-1, 1]] &, n, FreeQ[{13, 47}, #] &]] - 1;
Array[A392329, 100] (* Paolo Xausa, Jan 15 2026 *)
PROG
(PARI) a(n) = my(nb=0); until(n==13 || n==47, nb++; n=vecmax(factor(6*n+1)[, 1])); nb;
CROSSREFS
KEYWORD
nonn
AUTHOR
Alain Rocchelli, Jan 07 2026
STATUS
approved
