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 A331749 #8 Feb 05 2020 16:53:49 %S A331749 1,0,0,0,0,1,0,0,0,4,1,2,0,-1,0,-1,0,9,4,4,1,10,2,2,0,5,-1,1,0,1,-1,0, %T A331749 0,16,9,34,4,23,4,37,1,5,10,10,2,14,2,4,0,7,5,11,-1,5,1,6,0,-4,1,0,-1, %U A331749 -3,0,-1,0,57,16,116,9,98,34,84,4,69,23,103,4,9,37,98,1,52,5,70,10,19,10,39,2,19,14,38,2,34,4,18,0,39 %N A331749 a(n) = A002487(A163511(n)) - A002487(n). %H A331749 Antti Karttunen, <a href="/A331749/b331749.txt">Table of n, a(n) for n = 0..16384</a> %H A331749 Antti Karttunen, <a href="/A331749/a331749.txt">Data supplement: n, a(n) computed for n = 0..65537</a> %H A331749 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %H A331749 <a href="/index/St#Stern">Index entries for sequences related to Stern's sequences</a> %F A331749 a(n) = A323901(n) - A002487(n) = A002487(A163511(n)) - A002487(n). %F A331749 a(2^n) = 0 for all n >= 0. %o A331749 (PARI) %o A331749 A002487(n) = { my(a=1, b=0); while(n>0, if(bitand(n, 1), b+=a, a+=b); n>>=1); (b); }; \\ From A002487 %o A331749 A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940 %o A331749 A054429(n) = ((3<<#binary(n\2))-n-1); \\ From A054429 %o A331749 A163511(n) = if(!n,1,A005940(1+A054429(n))); %o A331749 A331749(n) = (A002487(A163511(n)) - A002487(n)); %Y A331749 Cf. A002487, A163511, A323901, A331743, A331748. %K A331749 sign %O A331749 0,10 %A A331749 _Antti Karttunen_, Feb 05 2020