|
Search: id:A100994
|
|
|
| A100994 |
|
If n is a prime power p^m, m >= 1, then n, otherwise 1. |
|
+0
10
|
|
| 1, 2, 3, 4, 5, 1, 7, 8, 9, 1, 11, 1, 13, 1, 1, 16, 17, 1, 19, 1, 1, 1, 23, 1, 25, 1, 27, 1, 29, 1, 31, 32, 1, 1, 1, 1, 37, 1, 1, 1, 41, 1, 43, 1, 1, 1, 47, 1, 49, 1, 1, 1, 53, 1, 1, 1, 1, 1, 59, 1, 61, 1, 1, 64, 1, 1, 67, 1, 1, 1, 71, 1, 73, 1, 1, 1, 1, 1, 79, 1, 81, 1, 83, 1, 1, 1, 1, 1, 89, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n) = A014963(n)^A100995(n) = n^A010055(n);
a(A000961(n)) = A000961(n).
a(n) is the smallest positive integer such that n divides LCM(a(1),a(2),a(3),...a(n)), for all positive integers n. - Leroy Quet May 01 2007
a(1) = 1 is ambiguous: it could be 1 because 1 is a prime power p^0 for any prime p (if 0 is admitted as exponent) or it could be 1 because 1 is not a prime power (if 0 is not admitted as exponent.) [From Daniel Forgues (squid(AT)zensearch.com), Aug 18 2009]
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
CROSSREFS
|
Sequence in context: A082299 A081806 A059806 this_sequence A140523 A017666 A030105
Adjacent sequences: A100991 A100992 A100993 this_sequence A100995 A100996 A100997
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 26 2004
|
|
EXTENSIONS
|
Definition edited (to remove ambiguity, cf. A100995) by Daniel Forgues (squid(AT)zensearch.com), Aug 18 2009
|
|
|
Search completed in 0.002 seconds
|
