OFFSET
1,1
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1024 from R. J. Mathar)
FORMULA
MAPLE
n := 1 ;
for k from 2 to 4000 by 2 do
dgs := convert(k, base, 2) ;
if op(-1, dgs) = 1 and op(-2, dgs) = 0 then
printf("%d %d\n", n, k) ;
n := n+1 ;
end if;
end do: # R. J. Mathar, Jan 31 2015
MATHEMATICA
Select[Range[2, 200, 2], IntegerDigits[#, 2][[1 ;; 2]] == {1, 0} &] (* Amiram Eldar, Sep 01 2020 *)
PROG
(Python)
from itertools import count, product, takewhile
def agen(): # generator for sequence
yield 2
for digits in count(0):
for mid in product("01", repeat=digits):
yield int("10" + "".join(mid) + "0", 2)
def aupto(lim): return list(takewhile(lambda x: x <= lim, agen()))
print(aupto(180)) # Michael S. Branicky, Jun 24 2021
(PARI) isok(m) = if (!(m%2), my(b=binary(m)); (b[1]==1) && (b[2]==0)); \\ Michel Marcus, Jun 24 2021
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Oct 12 2010
STATUS
approved