|
Search: id:A126028
|
|
|
| A126028 |
|
Perfect square roots: numbers such that (SOPF(n)*d(n))^2 = sigma(n) where SOPF(n) =sum of prime factors of n, d(n) = number of divisors of n, sigma(n) = sum of divisors of n. |
|
+0
2
|
|
| 22446139, 26116291, 28097023, 30236557, 31090489, 31124341, 49941589, 61137673, 62224039, 66960589, 71334867, 71585139, 82266591, 83045869, 92346023, 92837591, 105183961, 114762567, 123563821, 130399138, 131494219
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Mersenne Forum, Perfect roots
|
|
EXAMPLE
|
n = 22446139 factors as 31*67*101*107. SOPF(n) = 31+67+101+107 = 306, d(n) = 2^4 = 16, sigma(n) = (31+1)*(67+1)*(101+1)*(107+1) = 23970816, (SOPF(n)*d(n))^2 = (306*16)^2 = 23970816 = sigma(n).
|
|
CROSSREFS
|
Subsequence of A006532. Cf. A126029, A008472, A000005, A000203.
Sequence in context: A069317 A022211 A046397 this_sequence A069377 A114666 A157078
Adjacent sequences: A126025 A126026 A126027 this_sequence A126029 A126030 A126031
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Fred Schneider (frederick.william.schneider(AT)gmail.com), Dec 14 2006
|
|
EXTENSIONS
|
Clarified and extended by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Oct 11 2009
|
|
|
Search completed in 0.002 seconds
|
