Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 Feb 09 2023 01:58:25
%S 0,3,62,1021,16380,262143,4194298,67108857,1073741816,17179869179,
%T 274877906934,4398046511093,70368744177652,1125899906842615,
%U 18014398509481970,288230376151711729,4611686018427387888,73786976294838206451,1180591620717411303406,18889465931478580854765
%N a(0)=0; for n>0, a(n) = A102371(4n)/4.
%H Amiram Eldar, <a href="/A104403/b104403.txt">Table of n, a(n) for n = 0..250</a> (calculated from the b-file at A102371)
%H David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [<a href="http://neilsloane.com/doc/slopey.pdf">pdf</a>, <a href="http://neilsloane.com/doc/slopey.ps">ps</a>].
%H David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL8/Sloane/sloane300.html">Sloping binary numbers: a new sequence related to the binary numbers</a>, J. Integer Seq. 8 (2005), no. 3, Article 05.3.6, 15 pp.
%F a(0) = 0; for n>0, a(n) = 2^(4n-2) - A109680(n). - _Philippe Deléham_, May 08 2005
%Y Cf. A102371, A109680.
%K nonn
%O 0,2
%A _N. J. A. Sloane_, Apr 18 2005