login
a(n) = n / A280686(n); n divided by its largest Fibonacci proper divisor, a(1) = 1.
4

%I #9 Jan 12 2017 07:18:11

%S 1,2,3,2,5,2,7,4,3,2,11,4,13,7,3,2,17,6,19,4,7,11,23,3,5,2,9,14,29,6,

%T 31,4,11,17,7,12,37,19,3,5,41,2,43,22,9,23,47,6,49,10,17,4,53,18,11,7,

%U 19,29,59,12,61,31,3,8,5,22,67,2,23,14,71,9,73,37,15,38,77,6,79,10,27,41,83,4,17,43,29,11,89,18,7,46,31,47,19,12,97,49,33,20

%N a(n) = n / A280686(n); n divided by its largest Fibonacci proper divisor, a(1) = 1.

%C For n > 1, a(n) = n divided by the greatest Fibonacci number that divides n and is less than n.

%H Antti Karttunen, <a href="/A280687/b280687.txt">Table of n, a(n) for n = 1..10946</a>

%F a(n) = n / A280686(n).

%F a(A000045(n)) = A280690(n).

%o (Scheme) (define (A280687 n) (/ n (A280686 n)))

%Y Cf. A000045, A280686, A280690, A280697.

%K nonn

%O 1,2

%A _Antti Karttunen_, Jan 11 2017