|
Search: id:A071830
|
|
|
| A071830 |
|
Smallest k > n such that Lpf(n) = Lpf(k) where Lpf(x) denotes the largest prime factor in x factorization. |
|
+0
2
|
|
| 4, 6, 8, 10, 9, 14, 16, 12, 15, 22, 18, 26, 21, 20, 32, 34, 24, 38, 25, 28, 33, 46, 27, 30, 39, 36, 35, 58, 40, 62, 64, 44, 51, 42, 48, 74, 57, 52, 45, 82, 49, 86, 55, 50, 69, 94, 54, 56, 60, 68, 65, 106, 72, 66, 63, 76, 87, 118, 75, 122, 93, 70, 128, 78, 77, 134, 85, 92
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
PROGRAM
|
(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(n+s, ", "))
|
|
CROSSREFS
|
Sequence in context: A161396 A145256 A087789 this_sequence A167146 A020891 A090967
Adjacent sequences: A071827 A071828 A071829 this_sequence A071831 A071832 A071833
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 08 2002
|
|
|
Search completed in 0.002 seconds
|
