|
| |
|
|
A091853
|
|
a(n) = number of numbers k such that k is obtained by permuting the digits of n and gcd(n,k) > 1.
|
|
1
| |
|
|
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 2, 1, 1, 1, 2, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 6, 1, 4, 6
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,12
|
|
|
EXAMPLE
| 1 is the only number obtained by permuting the digits of 1, gcd(1,1) = 1, hence a(1) = 0.
001, 010, 100 are the numbers obtained by permuting the digits of 100, gcd(100,1) = 1, gcd(100,10) = 10, gcd(100,100) = 100, hence a(100) = 2.
|
|
|
CROSSREFS
| Cf. A091854.
Sequence in context: A112195 A103956 A103957 * A091304 A049847 A025431
Adjacent sequences: A091850 A091851 A091852 * A091854 A091855 A091856
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 13 2004
|
|
|
EXTENSIONS
| Edited, corrected and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Mar 16 2004
|
| |
|
|
