|
Search: id:A162901
|
|
|
| A162901 |
|
a(1)=1. For n>=2, a(n) = the smallest integer >= a(n-1) such that GCD(n,a(n)) = p^k, where p = prime, k >= 1. |
|
+0
2
|
|
| 1, 2, 3, 4, 5, 8, 14, 14, 15, 15, 22, 22, 26, 26, 27, 28, 34, 34, 38, 38, 39, 40, 46, 46, 50, 50, 51, 52, 58, 58, 62, 62, 63, 64, 65, 68, 74, 74, 75, 75, 82, 82, 86, 86, 87, 88, 94, 94, 98, 98, 99, 100, 106, 106, 115, 116, 117, 118, 118, 118, 122, 122, 123, 124, 125, 128
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
PROGRAM
|
(PARI) a=1; print1(a, ", "); for(n=2, 100, while(omega(gcd(n, a))!=1, a++); print1(a, ", ")) [From Hagen von Eitzen (math(AT)von-eitzen.de), Oct 03 2009]
|
|
CROSSREFS
|
A162900
Sequence in context: A065490 A051706 A152526 this_sequence A162900 A140294 A108014
Adjacent sequences: A162898 A162899 A162900 this_sequence A162902 A162903 A162904
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jul 16 2009
|
|
EXTENSIONS
|
More terms from Hagen von Eitzen (math(AT)von-eitzen.de), Oct 03 2009
|
|
|
Search completed in 0.002 seconds
|
