|
Search: id:A129308
|
|
|
| A129308 |
|
a(n) = number of positive integers k where k(k+1) divides n. |
|
+0
5
|
|
| 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 3, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 3, 0, 1, 0, 2, 0, 3, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 5, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 4, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 4, 0, 1, 0, 1, 0, 4, 0, 1, 0, 1, 0, 3, 0, 1, 0, 2, 0, 2, 0, 1, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
LINKS
|
Ray Chandler, Table of n, a(n) for n=1..10000
Leroy Quet, Home Page (listed in lieu of email address)
|
|
FORMULA
|
a(2n-1) = 0; a(2n) = A007862(n). - Chandler
|
|
EXAMPLE
|
The divisors of 20 are 1,2,4,5,10,20. Of these there are two that are of the form k(k+1): 2 = 1*2 and 20 = 4*5. So a(2) = 2.
|
|
MATHEMATICA
|
a = {}; For[n = 1, n < 90, n++, k = 1; co = 0; While[k < Sqrt[n], If[IntegerQ[ n/(k*(k + 1))], co++ ]; k++ ]; AppendTo[a, co]]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 27 2007
|
|
CROSSREFS
|
Cf. A007862.
Sequence in context: A133565 A035169 A067432 this_sequence A159200 A033764 A033784
Adjacent sequences: A129305 A129306 A129307 this_sequence A129309 A129310 A129311
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet, May 26 2007
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 27 2007
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jun 24 2008
|
|
|
Search completed in 0.002 seconds
|
