login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A190998 Digital root of concatenation of all divisors of n (A037278). 5
1, 3, 4, 7, 6, 3, 8, 6, 4, 9, 3, 1, 5, 6, 6, 4, 9, 3, 2, 6, 5, 9, 6, 6, 4, 6, 4, 2, 3, 9, 5, 9, 3, 9, 3, 1, 2, 6, 2, 9, 6, 6, 8, 3, 6, 9, 3, 7, 3, 3, 9, 8, 9, 3, 9, 3, 8, 9, 6, 6, 8, 6, 5, 1, 3, 9, 5, 9, 6, 9, 9, 6, 2, 6, 7, 5, 6, 6, 8, 6, 4, 9, 3, 8, 9, 6, 3, 9, 9, 9, 4, 6, 2, 9, 3, 9, 8, 9, 3, 1, 3, 9, 5, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Also digital root of A034690 (sum of digits of all the divisors of n).
Also digital root of A000203 (sum of divisors of n). - Michel Marcus, Sep 13 2014
LINKS
EXAMPLE
For n = 12: 1 + 2 + 3 + 4 + 6 + 1 + 2 = 19, 1 + 9 = 10, 1 + 0 = 1; a(12) = 1.
MAPLE
A190998:=proc(n) local d, i, s: d:=numtheory[divisors](n): s:=0: for i from 1 to nops(d) do s:=s+((d[i]-1) mod 9)+1: if(s>=10)then s:=((s-1) mod 9)+1: fi: od: return s: end: seq(A190998(n), n=1..105); # Nathaniel Johnston, Jun 15 2011
CROSSREFS
Sequence in context: A017665 A248789 A105852 * A067342 A348987 A322656
KEYWORD
nonn,easy,base
AUTHOR
Jaroslav Krizek, Jun 15 2011
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)