|
|
A135481
|
|
a(n) = 2^A007814(n+1) - 1.
|
|
11
|
|
|
0, 1, 0, 3, 0, 1, 0, 7, 0, 1, 0, 3, 0, 1, 0, 15, 0, 1, 0, 3, 0, 1, 0, 7, 0, 1, 0, 3, 0, 1, 0, 31, 0, 1, 0, 3, 0, 1, 0, 7, 0, 1, 0, 3, 0, 1, 0, 15, 0, 1, 0, 3, 0, 1, 0, 7, 0, 1, 0, 3, 0, 1, 0, 63, 0, 1, 0, 3, 0, 1, 0, 7, 0, 1, 0, 3, 0, 1, 0, 15, 0, 1, 0, 3, 0, 1, 0, 7, 0, 1, 0, 3, 0, 1, 0, 31, 0, 1, 0, 3, 0, 1, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
This is Guy Steele's sequence GS(1, 6) (see A135416).
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
|
|
MATHEMATICA
|
Table[BitAnd[i, BitNot[i+1]], {i, 0, 200}] (* Peter Luschny, Jun 01 2011 *)
|
|
PROG
|
(PARI) a(n) = 2^valuation(n+1, 2)-1; \\ Michel Marcus, Nov 19 2017
(Julia)
using IntegerSequences
A135481List(len) = [Bits("CNIMP", n+1, n) for n in 0:len]
(Python)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|