|
Search: id:A127268
|
|
|
| A127268 |
|
If the prime-factorization of n is n = product{p|n} p^b(p,n) (p = distinct primes divisors of n, each b(p,n) is a positive integer), then a(n) is (sum{p|n} p^b(p,n)) taken mod (sum{p|n} p). |
|
+0
1
|
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 6, 0, 0, 0, 2, 6, 0, 0, 4, 0, 6, 0, 2, 0, 4, 0, 6, 0, 0, 0, 2, 0, 0, 6, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 4, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 6, 0, 6, 0, 2, 0, 0, 0, 0, 0, 6, 6, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,12
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
FORMULA
|
A008475(n) mod A008472(n), if n>1. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 01 2007
|
|
EXAMPLE
|
40 = 2^3 *5^1. So a(40) = 2^3 + 5^1 (mod (2+5)) = 13 (mod 7) = 6.
|
|
MAPLE
|
A008475 := proc(n) local ifs ; if n =1 then 0; else ifs := ifactors(n)[2] ; add(op(1, i)^op(2, i), i =ifs) ; fi ; end: A008472 := proc(n) local ifs ; if n =1 then 0; else ifs := ifactors(n)[2] ; add(op(1, i), i =ifs) ; fi ; end: A127268 := proc(n) if n = 1 then 0 ; else A008475(n) mod A008472(n) ; fi ; end: seq(A127268(n), n=1..100) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 01 2007
|
|
CROSSREFS
|
Sequence in context: A033772 A086015 A086012 this_sequence A083918 A083895 A093488
Adjacent sequences: A127265 A127266 A127267 this_sequence A127269 A127270 A127271
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet, Mar 27 2007
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 01 2007
|
|
|
Search completed in 0.002 seconds
|
