|
Search: id:A133438
|
|
|
| A133438 |
|
a(1)=1. a(n) = sum{k|n} a(floor(sqrt(k))). |
|
+0
1
|
|
| 1, 2, 2, 4, 3, 5, 3, 6, 4, 6, 3, 9, 3, 6, 6, 10, 5, 11, 5, 12, 8, 8, 5, 15, 6, 7, 7, 11, 4, 14, 4, 13, 7, 9, 8, 20, 6, 11, 9, 19, 6, 18, 6, 15, 13, 11, 6, 24, 6, 12, 9, 12, 4, 17, 8, 16, 9, 8, 4, 25, 4, 8, 13, 19, 11, 20, 7, 17, 12, 19, 7, 32, 7, 13, 15, 19, 11, 21, 7, 29, 11, 11, 5, 29, 11, 11, 9
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
Matthew M. Conroy, Home Page, listed in lieu of email address.
|
|
EXAMPLE
|
The divisors of 12 are 1,2,3,4,6,12. The floor of the squareroots of these are 1,1,1,2,2,3. So a(12) = a(1)+a(1)+a(1)+a(2)+a(2)+a(3) = 1+1+1+2+2+2 = 9.
|
|
MAPLE
|
A133438 := proc(n) option remember ; local a, d; if n = 1 then 1; else a := 0 ; for d in numtheory[divisors](n) do a := a+ A133438(floor(sqrt(d))) ; od: RETURN(a) ; fi ; end: seq(A133438(n), n=1..60) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 08 2008
|
|
CROSSREFS
|
Sequence in context: A131816 A128181 A125185 this_sequence A086671 A054346 A145393
Adjacent sequences: A133435 A133436 A133437 this_sequence A133439 A133440 A133441
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Nov 26 2007
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl) and Matthew M. Conroy, Jan 08 2008
|
|
|
Search completed in 0.002 seconds
|
