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 A306632 #14 Mar 04 2019 07:39:59
%S A306632 1,3,7,3571,9349,710647,12752043
%N A306632 Numbers n which are both lucky (A000959) and Lucas (A000032).
%C A306632 No more terms below 10^9.
%C A306632 Calculated using _Hugo van der Sanden_'s Lucky numbers up to 10^9.
%t A306632 m = 10^4; L = Table[2*i + 1, {i, 0, m}]; For[n = 2, n < Length[L], r = L[[n++]]; L = ReplacePart[L, Table[r*i -> Nothing, {i, 1, Length[L]/r}]]]; lucas = {}; n = 1; While[(l = LucasL[n]) < m, AppendTo[lucas, l]; n++]; Intersection[L, lucas] (* after _Jean-François Alcover_ at A000959 *)
%o A306632 (Perl) use ntheory ':all'; for (1..35) { my $n = lucasv(1, -1, $_); print "$n\n" if is_lucky($n) } # _Daniel Suteu_, Mar 02 2019
%Y A306632 Cf. A000032, A000959, A057589, A130594, A140285.
%K A306632 nonn,more
%O A306632 1,2
%A A306632 _Amiram Eldar_, Mar 02 2019