|
Search: id:A110700
|
|
|
| A110700 |
|
Number of zeros in the smallest prime with Hamming weight n (given by A061712). |
|
+0
5
|
|
| 1, 0, 0, 1, 0, 3, 0, 1, 1, 1, 1, 1, 0, 3, 1, 1, 0, 1, 0, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 0, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 0, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
a(n)=0 iff n belongs A000043.
Observe that a(n)=3 for n=6, 14, 30, 62, 126, 254, 510, 1022, ... which is A000918. Conjecture: a(n) is never greater than 3. - T. D. Noe, Mar 14 2008
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1024
|
|
FORMULA
|
A110700(n) = A110699(n) - n
|
|
MAPLE
|
with(combstruct); a:=proc(n) local m, is, s, t, r; if n=1 then return 1 fi; r:=+infinity; for m from 0 do is := iterstructs(Combination(n-2+m), size=n-2); while not finished(is) do s := nextstruct(is); t := 2^(n-1+m)+1+add(2^i, i=s); if isprime(t) then return m fi; od; od; return 0; end;
|
|
CROSSREFS
|
Cf. A000043, A061712, A110699.
Sequence in context: A101949 A124796 A065714 this_sequence A051908 A056614 A092510
Adjacent sequences: A110697 A110698 A110699 this_sequence A110701 A110702 A110703
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Max Alekseyev (maxale(AT)gmail.com), Aug 03 2005
|
|
|
Search completed in 0.002 seconds
|
