|
Search: id:A087990
|
|
|
| A087990 |
|
Number of palindromic divisors of n. |
|
+0
5
|
|
| 1, 2, 2, 3, 2, 4, 2, 4, 3, 3, 2, 5, 1, 3, 3, 4, 1, 5, 1, 4, 3, 4, 1, 6, 2, 2, 3, 4, 1, 5, 1, 4, 4, 2, 3, 6, 1, 2, 2, 5, 1, 5, 1, 6, 4, 2, 1, 6, 2, 3, 2, 3, 1, 5, 4, 5, 2, 2, 1, 6, 1, 2, 4, 4, 2, 8, 1, 3, 2, 4, 1, 7, 1, 2, 3, 3, 4, 4, 1, 5, 3, 2, 1, 6, 2, 2, 2, 8, 1, 6, 2, 3, 2, 2, 2, 6, 1, 3, 6, 4, 2, 4, 1, 4, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
n=132: divisors={1, 2, 3, 4, 6, 11, 12, 22, 33, 44, 66, 132}, revdivisors={1, 2, 3, 4, 6, 11, 21, 22, 33, 44, 66, 231}, a[132]=10; so 10 of 12 divisors of n are palindromic: {1, 2, 3, 4, 6, 11, 22, 33, 44, 66}
|
|
MATHEMATICA
|
nd[x_, y_] := 10*x+y; tn[x_] := Fold[nd, 0, x]; rdi[x_] := tn[Reverse[IntegerDigits[x]]]; d0[x_] := DivisorSigma[0, x]; di[x_, i_] := Part[Divisors[x], i]; Table[Count[Divisors[s]-Table[rdi[di[s, w]], {w, 1, d0[s]}], 0], {s, 1, 256}]
|
|
CROSSREFS
|
Cf. A087991, A062687.
Sequence in context: A083903 A083867 A076888 this_sequence A138707 A095048 A084302
Adjacent sequences: A087987 A087988 A087989 this_sequence A087991 A087992 A087993
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Oct 08 2003
|
|
|
Search completed in 0.002 seconds
|
