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 A256487 #7 May 01 2015 13:13:03 %S A256487 2,4,0,4,10,18,16,36,28,48,78,80,62,90,76,110,134,158,200,220,224,216, %T A256487 236,280,308,312,262,314,328,402,430,424,438,488,506,538,414,510,642, %U A256487 620,680,648,656,690,666,684,730,790,742,840,844,862,916,976,1004,1092,1072,1112,1054,1166,1176,1184,1292 %N A256487 a(n) = A254100(n) - A219178(n). %C A256487 Difference between the least nonludic number removed at the n-th stage of Ludic sieve and the least unlucky number removed at the n-th stage of Lucky sieve. %H A256487 Antti Karttunen, <a href="/A256487/b256487.txt">Table of n, a(n) for n = 1..933</a> %H A256487 <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a> %F A256487 a(n) = A254100(n) - A219178(n). %o A256487 (Scheme) (define (A256487 n) (- (A254100 n) (A219178 n))) %Y A256487 Cf. A219178, A254100, A256482, A256486, A256488 (same terms divided by 2). %K A256487 nonn %O A256487 1,1 %A A256487 _Antti Karttunen_, May 01 2015