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 A260722 #10 Aug 10 2015 07:27:57 %S A260722 0,0,-2,-2,-2,-2,-4,-2,-6,-4,0,-2,-6,-4,-10,-6,-2,-2,2,4,2,-2,-2,2,4, %T A260722 4,-6,-2,-2,8,8,6,2,10,6,8,-8,0,14,10,16,12,8,10,4,4,10,16,6,16,16,14, %U A260722 18,22,24,32,28,30,22,32,32,30,38,34,32,36,40,30,28,28,32,24,22,24,36,38,42,30,30,22,26,26,30,38,40,30,36,46,48,46,56,54,54,54,40,46 %N A260722 Difference between n-th odd Ludic and n-th Lucky number: a(1) = 0; for n > 1: a(n) = A003309(n+1) - A000959(n). %C A260722 Equally: for n >= 2, the difference between (n+1)-th Ludic and n-th Lucky number. %H A260722 Antti Karttunen, <a href="/A260722/b260722.txt">Table of n, a(n) for n = 1..10000</a> %H A260722 <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a> %F A260722 a(1) = 0; for n > 1: a(n) = A003309(n+1) - A000959(n). %F A260722 Other identities. For all n >= 2: %F A260722 a(n) = A256486(n) + A260723(n). %F A260722 a(n) = A256486(n+1) + A031883(n). %o A260722 (Scheme) (define (A260722 n) (if (= 1 n) 0 (- (A003309 (+ 1 n)) (A000959 n)))) %Y A260722 Cf. A000959, A003309, A031883, A260721 (same terms divided by two), A260723, A256486, A256487. %Y A260722 Cf. also permutations A260435, A260436, A260741, A260742. %K A260722 sign %O A260722 1,3 %A A260722 _Antti Karttunen_, Aug 06 2015