|
Search: id:A005086
|
|
|
| A005086 |
|
Number of Fibonacci numbers 1,2,3,5,... dividing n. |
|
+0
5
|
|
| 1, 2, 2, 2, 2, 3, 1, 3, 2, 3, 1, 3, 2, 2, 3, 3, 1, 3, 1, 3, 3, 2, 1, 4, 2, 3, 2, 2, 1, 4, 1, 3, 2, 3, 2, 3, 1, 2, 3, 4, 1, 4, 1, 2, 3, 2, 1, 4, 1, 3, 2, 3, 1, 3, 3, 3, 2, 2, 1, 4, 1, 2, 3, 3, 3, 3, 1, 3, 2, 3, 1, 4, 1, 2, 3, 2, 1, 4, 1, 4, 2, 2, 1, 4, 2, 2, 2, 3, 2, 4, 2, 2, 2, 2, 2, 4, 1, 2, 2, 3, 1, 4, 1, 4, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n) <= A072649(n). - Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 10 2006
First occurrence of k is A000142 = Factorial numbers. - Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 10 2006
Indices of records are in A129655. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 02 2007
|
|
FORMULA
|
Equals A051731 * A010056 - Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 06 2007
|
|
MAPLE
|
with(combinat): for n from 1 to 200 do printf(`%d, `, sum(floor(n/fibonacci(k))-floor((n-1)/fibonacci(k)), k=2..15)) od:
|
|
MATHEMATICA
|
f[n_] := Block[{k = 1}, While[Fibonacci[k] <= n, k++ ]; Count[ Mod[n, Array[ Fibonacci, k - 1]], 0] - 1]; Array[f, 105] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
Cf. A038663.
Cf. A051731, A010056.
Sequence in context: A090872 A063473 A096859 this_sequence A157372 A020649 A067131
Adjacent sequences: A005083 A005084 A005085 this_sequence A005087 A005088 A005089
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Feb 19 2001
|
|
|
Search completed in 0.002 seconds
|
