This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A280697 #7 Jan 12 2017 07:19:41 %S A280697 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, %T A280697 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, %U A280697 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 %N A280697 a(n) = n / A280696(n); n divided by its largest Lucas proper divisor, a(1) = 1. %C A280697 For n > 1, a(n) = n divided by the greatest Lucas number (A000032) that divides n and is less than n. %H A280697 Antti Karttunen, <a href="/A280697/b280697.txt">Table of n, a(n) for n = 1..15127</a> %F A280697 a(n) = n / A280696(n). %o A280697 (Scheme) (define (A280697 n) (/ n (A280696 n))) %Y A280697 Cf. A000032, A280695, A280696, A280687. %K A280697 nonn %O A280697 1,2 %A A280697 _Antti Karttunen_, Jan 11 2017