A280697 a(n) = n / A280696(n); n divided by its largest Lucas proper divisor, a(1) = 1.

1, 2, 3, 2, 5, 2, 7, 2, 3, 5, 11, 3, 13, 2, 5, 4, 17, 6, 19, 5, 3, 2, 23, 6, 25, 13, 9, 4, 29, 10, 31, 8, 3, 17, 5, 2, 37, 19, 13, 10, 41, 6, 43, 4, 15, 23, 47, 12, 7, 25, 17, 13, 53, 3, 5, 8, 19, 2, 59, 15, 61, 31, 9, 16, 65, 6, 67, 17, 23, 10, 71, 4, 73, 37, 25, 19, 7, 26, 79, 20, 27, 41, 83, 12, 85, 43, 3, 8, 89, 5, 13, 23, 31, 2, 95, 24, 97, 14, 9, 25, 101

Offset

1,2

Comments

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

Links

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

Formula

a(n) = n / A280696(n).

Prog

(Scheme) (define (A280697 n) (/ n (A280696 n)))

Crossrefs

Cf. A000032, A280695, A280696, A280687.

Sequence in context: A363895 A086765 A079868 * A088444 A108077 A248737

Adjacent sequences: A280694 A280695 A280696 * A280698 A280699 A280700

Keyword

nonn

Author

Antti Karttunen, Jan 11 2017

Status

approved