login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A056148
a(0) = 1, a(n) = number of a(k), for 0 <= k <= n-1, that divide n.
1
1, 1, 2, 2, 4, 2, 5, 2, 7, 2, 8, 2, 9, 2, 10, 3, 11, 2, 12, 2, 14, 4, 12, 2, 18, 3, 12, 5, 16, 2, 18, 2, 18, 5, 14, 6, 26, 2, 15, 4, 23, 2, 22, 2, 22, 9, 18, 2, 29, 3, 22, 5, 22, 2, 29, 7, 27, 5, 21, 2, 37, 2, 21, 11, 26, 7, 31, 2, 25, 6, 33, 2, 41, 2, 25, 13, 27, 7, 32, 2, 36, 9, 26, 2, 45
OFFSET
0,3
LINKS
EXAMPLE
a(6) = 5 because a(0), a(1), a(2), a(3) and a(5) divide 6.
MATHEMATICA
a[0] = 1; a[n_] := a[n] = Count[Range[0, n - 1], _?(Divisible[n, a[#]] &)]; Array[a, 100, 0] (* Amiram Eldar, May 26 2024 *)
CROSSREFS
Sequence in context: A140773 A133911 A069932 * A304442 A057567 A353845
KEYWORD
easy,nonn
AUTHOR
Leroy Quet, Aug 04 2000
STATUS
approved