1,1

Apart from the first term, a(n) is the number of Fibonacci(k) | Fibonacci(n), with 0 < k <= n. - Paolo P. Lava, Mar 29 2017

Antti Karttunen, Table of n, a(n) for n = 1..1001

a(n) = A000005(n) + A000035(n) = tau(n)+(n mod 2), where tau(n) = the number of divisors of n.

(PARI) a(n) = numdiv(n) + (n % 2) \\ Michel Marcus, Jun 17 2013

Cf. A000005, A000045, A023645, A062249 (labeled case).

One more than A076984.

Sequence in context: A073734 A231335 A271237 * A072789 A126302 A200648

Adjacent sequences: A062555 A062556 A062557 * A062559 A062560 A062561

nonn

Vladeta Jovovic, Jul 03 2001

approved