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 A039673 #7 Aug 02 2015 21:36:00
%S A039673 2,4,5,7,11,13,23,25,38,40,50,52,56,58,59,61,74,76,86,88,101,103,104,
%T A039673 106,122,124,131,133,149,151,164,166,173,175,185,187,200,202,236,238,
%U A039673 248,250,254,256,266,268,275,277,281,283,308,310,329,331,344,346,380
%N A039673 Twin Fibonacci-lucky numbers.
%C A039673 See A039672 for definition.
%p A039673 From _R. J. Mathar_, Oct 10 2010: (Start)
%p A039673 A039672 := proc(nmax) L := [seq(i,i=1..nmax)] ; for itr from 1 do if itr+1 > nops(L) then return L; end if; str := op(itr,L)+op(itr+1,L) ; for i from floor(nops(L)/str) to 1 by -1 do L := subsop(str*i=NULL,L) ; end do: print(L) ; end do: end proc:
%p A039673 L := A039672(600) ; for i from 1 to nops(L)-1 do if op(i,L) = op(i+1,L)-2 then printf("%d,%d,",op(i,L),op(i+1,L)) ; fi; end do: (End)
%Y A039673 Cf. A039672 - Lower terms: A039693, upper terms: A039694, middle terms: A039695.
%K A039673 nonn
%O A039673 1,1
%A A039673 _Felice Russo_
%E A039673 Corrected from a(25) on by _R. J. Mathar_, Oct 10 2010