|
Search: id:A045876
|
|
|
| A045876 |
|
Sum of different permutations of digits of n (leading 0's allowed). |
|
+0
2
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 11, 33, 44, 55, 66, 77, 88, 99, 110, 22, 33, 22, 55, 66, 77, 88, 99, 110, 121, 33, 44, 55, 33, 77, 88, 99, 110, 121, 132, 44, 55, 66, 77, 44, 99, 110, 121, 132, 143, 55, 66, 77, 88, 99, 55, 121, 132, 143, 154, 66, 77, 88, 99, 110, 121, 66, 143
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Let the arithmetic mean of the digits of a 'D' digit number n be 'A', Let 'N' = number of distinct numbers that can be formed by permuting the digits of n and let 'I' = concatenation of 1 'D' times =(10^D-1)/9. then a(n) = A*N*I. E.g. Let n = 324541 then A= (3+2+4+5+4+1)/6 =19/6. N = 6!/(2!) = 60. I = 111111 a(n) = A*N*I = (19/6)*(60)*(111111) = 21111090. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 14 2003
|
|
REFERENCES
|
Amarnath Murthy, An interesting result in combinatorics., Mathematics & Informatics Quarterly, Vol. 3, 1999, Bulgaria.
|
|
CROSSREFS
|
Same beginning as A033865. Cf. A061147.
Sequence in context: A123241 A033862 A082273 this_sequence A033865 A118764 A057717
Adjacent sequences: A045873 A045874 A045875 this_sequence A045877 A045878 A045879
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Erich Friedman (erich.friedman(AT)stetson.edu)
|
|
|
Search completed in 0.002 seconds
|
