login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A161184
Digital roots of highly composite numbers (A002182).
1
1, 2, 4, 6, 3, 6, 9, 3, 6, 3, 9, 6, 9, 9, 3, 9, 6, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9
OFFSET
1,2
COMMENTS
a(n)=9 for n > 17 because for those n, the highly composite number A002182(n) is divisible by 9. - T. D. Noe, Jul 28 2009
FORMULA
a(n) = A010888(A140645(n)). - R. J. Mathar, Jun 15 2009
EXAMPLE
7560 is a highly composite number whose digital root is 9.
MAPLE
read("transforms3"): L := BFILETOLIST("b002182.txt") : A007953 := proc(n) add(d, d=convert(n, base, 10)) ; end: A010888 := proc(n) local a ; a := A007953(n) ; while a > 9 do a := A007953(a) ; od; a; end: for i from 1 to 200 do printf("%d, ", A010888(op(i, L))) ; od: # R. J. Mathar, Jun 15 2009
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
Parthasarathy Nambi, Jun 05 2009
EXTENSIONS
Extended by R. J. Mathar, Jun 15 2009
STATUS
approved