|
|
A088167
|
|
Number of earlier occurring divisors of n; a(1)=1.
|
|
10
|
|
|
1, 1, 2, 3, 2, 5, 2, 5, 3, 7, 2, 8, 2, 8, 6, 9, 2, 12, 2, 11, 5, 10, 2, 16, 5, 10, 5, 11, 2, 21, 2, 15, 6, 12, 8, 19, 2, 14, 4, 24, 2, 21, 2, 18, 11, 15, 2, 28, 3, 23, 5, 17, 2, 24, 11, 24, 6, 17, 2, 37, 2, 19, 9, 24, 8, 29, 2, 23, 7, 31, 2, 41, 2, 23, 13, 25, 8, 29, 2, 38, 7, 24, 2, 40
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
a(n) = #{k: 1<=k<n & n mod a(k) = 0};
a(n)=2 iff n is an odd prime;
|
|
LINKS
|
|
|
FORMULA
|
a(1) = 1; a(n) = [x^n] Sum_{k=1..n-1} x^a(k)/(1 - x^a(k)). - Ilya Gutkovskiy, Dec 11 2017
|
|
MAPLE
|
A[1]:= 1:
for n from 2 to 1000 do
A[n]:= numboccur(0, [seq(n mod A[j], j=1..n-1)])
od:
|
|
MATHEMATICA
|
Fold[Append[#1, Count[#1, x_ /; Divisible[#2, x]]] &, {1}, Range[2, 84]] (* Ivan Neretin, Sep 20 2015 *)
|
|
CROSSREFS
|
Cf. A124056 (counting divisors of a(n) instead of those of n).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|