

A055224


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


2



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, 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, 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
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


LINKS



EXAMPLE

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


PROG

(PARI) a = vector(86); for (n=1, #a, a[n] = if (n==1, 1, sum(k=1, n1, a[nk]%a[k]==0)); print1 (a[n] ", ")) \\ Rémy Sigrist, Jul 27 2018


CROSSREFS



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



