login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103530 a(n) = 2^n - A103529(n). 5
2, 1, 2, 1, 4, 3, 2, 5, 8, 7, 6, 1, 12, 11, 10, 13, 16, 15, 14, 9, 4, 19, 18, 21, 24, 23, 22, 17, 28, 27, 26, 29, 32, 31, 30, 25, 20, 3, 34, 37, 40, 39, 38, 33, 44, 43, 42, 45, 48, 47, 46, 41, 36, 51, 50, 53, 56, 55, 54, 49, 60, 59, 58, 61, 64, 63, 62, 57 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [pdf, ps].
David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers, J. Integer Seq. 8 (2005), no. 3, Article 05.3.6, 15 pp.
FORMULA
Also, miraculously, a(n+1) = 2^n - A102371(n) for n >= 1.
EXAMPLE
a(7) = 2^7 - A103529(7) = 128 - 126 = 2.
MAPLE
a:=proc(n)local k, t: if(n=1)then return 2:fi: t:= 2^(n-1) + (n-1): for k from 1 to n-1 do if(k = (n-1) mod 2^k)then t:=t-2^k: fi: od: return t: end: seq(a(n), n=1..80); # Nathaniel Johnston, Apr 30 2011
CROSSREFS
Sequence in context: A177236 A341827 A138567 * A090924 A247074 A160595
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 09:48 EDT 2024. Contains 371905 sequences. (Running on oeis4.)