The OEIS is supported by the many generous donors to the OEIS Foundation.

a(1) = 1, a(n) = number of a(k) with 1 <= k <= n-1 such that a(k) divides a(n-k).

2

`%I #12 Jul 28 2018 10:56:25
`

`%S 1,1,2,2,2,3,4,5,4,4,3,5,4,5,3,6,7,4,5,8,6,9,6,5,6,9,10,8,5,6,10,9,8,
`

`%T 6,6,10,11,12,9,8,13,5,11,8,8,11,6,15,7,14,11,5,13,13,10,10,5,13,8,14,
`

`%U 10,7,12,13,13,12,8,11,12,9,12,14,12,8,8,15,15,12,14,12,14,15,13,19,15,12
`

`%N a(1) = 1, a(n) = number of a(k) with 1 <= k <= n-1 such that a(k) divides a(n-k).
`

`%H Rémy Sigrist, <a href="/A055224/b055224.txt">Table of n, a(n) for n = 1..10000</a>
`

`%e a(10) = 4 because a(1)|a(9), a(2)|a(8), a(3)|a(7), a(5)|a(5).
`

`%o (PARI) a = vector(86); for (n=1, #a, a[n] = if (n==1, 1, sum(k=1, n-1, a[n-k]%a[k]==0)); print1 (a[n] ", ")) \\ _Rémy Sigrist_, Jul 27 2018
`

`%K nonn
`

`%O 1,3
`

`%A _Leroy Quet_, Jun 20 2000
`

`%E More terms from _James A. Sellers_, Jul 04 2000
`