|
| |
|
|
A071829
|
|
Smallest s > 0 such that Lpf(n) = Lpf(n+s) where Lpf(x) denotes the largest prime factor in x factorization.
|
|
0
| |
|
|
2, 3, 4, 5, 3, 7, 8, 3, 5, 11, 6, 13, 7, 5, 16, 17, 6, 19, 5, 7, 11, 23, 3, 5, 13, 9, 7, 29, 10, 31, 32, 11, 17, 7, 12, 37, 19, 13, 5, 41, 7, 43, 11, 5, 23, 47, 6, 7, 10, 17, 13, 53, 18, 11, 7, 19, 29, 59, 15, 61, 31, 7, 64, 13, 11, 67, 17, 23, 14, 71, 9, 73, 37, 5, 19, 11, 13, 79
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
PROG
| (PARI) for(n=2, 120, s=+1; while(abs(component(component(factor(n), 1), omega(n))-component(component(factor(n+s), 1), omega(n+s)))>0, s++); print1(s, ", "))
|
|
|
CROSSREFS
| Sequence in context: A134198 A060653 A081810 * A067620 A053585 A098988
Adjacent sequences: A071826 A071827 A071828 * A071830 A071831 A071832
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 08 2002
|
| |
|
|
