|
Search: id:A075493
|
|
|
| A075493 |
|
Sum of digits of n > number of divisors of n. |
|
+0
4
|
|
| 3, 4, 5, 6, 7, 8, 9, 13, 14, 15, 16, 17, 18, 19, 23, 25, 26, 27, 28, 29, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 46, 47, 48, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 66, 67, 68, 69, 71, 73, 74, 75, 76, 77, 78, 79, 81, 82, 83, 85, 86, 87, 88, 89, 91, 92
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
Solutions to A007953[x] > A000005[x]
|
|
EXAMPLE
|
For primes whose sum of digits > d[p]= 2. Prime squares whose sum of digits > 3 [like 4, 9, 49, 121, 169 etc.]
|
|
MATHEMATICA
|
sud[x_] := Apply[Plus, IntegerDigits[x]] Do[s=sud[n]-DivisorSigma[0, n]; If[s>0, Print[n]], {n, 1, 256}]
|
|
CROSSREFS
|
Cf. A007953, A000005, A057531, A075492, A075491.
Sequence in context: A067026 A096829 A039120 this_sequence A096828 A097389 A051415
Adjacent sequences: A075490 A075491 A075492 this_sequence A075494 A075495 A075496
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Sep 26 2002
|
|
|
Search completed in 0.002 seconds
|
