cp's OEIS Frontend

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.

A105024 a(n) = A102371(n) + n. Or, 2*A103745.

This page as a plain text file.
%I A105024 #11 May 05 2020 05:35:00
%S A105024 0,2,4,10,16,34,68,130,256,514,1028,2058,4096,8194,16388,32770,65536,
%T A105024 131074,262148,524298,1048592,2097154,4194308,8388610,16777216,
%U A105024 33554434,67108868,134217738,268435456,536870914,1073741828,2147483650,4294967296,8589934594
%N A105024 a(n) = A102371(n) + n. Or, 2*A103745.
%H A105024 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 A105024 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.
%p A105024 sm:= proc (n) local t1, l; t1 := 0; for l to n do if `mod`(n-l,2^l) = 0 then t1 := t1+2^l end if end do; t1 end proc;
%K A105024 nonn
%O A105024 0,2
%A A105024 _N. J. A. Sloane_, Apr 03 2005