|
Search: id:A080941
|
|
|
| A080941 |
|
Greatest divisor of n which is less n and also a suffix of n in binary representation; a(n)=0 if no such divisor exists. |
|
+0
9
|
|
| 0, 0, 1, 0, 1, 2, 1, 0, 1, 2, 1, 4, 1, 2, 3, 0, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 3, 4, 1, 6, 1, 0, 1, 2, 1, 4, 1, 2, 3, 8, 1, 2, 1, 4, 5, 2, 1, 16, 1, 2, 3, 4, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 7, 0, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 3, 4, 1, 6, 1, 16, 1, 2, 1, 4, 5, 2, 3, 8, 1, 10, 1, 4, 1, 2, 1, 32, 1, 2, 3, 4, 1, 6, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
a(n)=0 iff n=2^k (A000079);
|
|
EXAMPLE
|
n=30='11110', divisors<30: 1='1', 2='10', 3='11', 5='101', 6='110', 10='1010', and 15='1111', therefore a(30)=2='10';
n=31='11111', divisors<31: 1='1', therefore a(31)=1;
n=32='100000', divisors<32: 1='1', 2='10', 4='100', 8='1000', and 16='10000', therefore a(32)=0.
|
|
CROSSREFS
|
Cf. A007088, A080940, A080942.
Sequence in context: A076092 A080468 A080940 this_sequence A114021 A053616 A094718
Adjacent sequences: A080938 A080939 A080940 this_sequence A080942 A080943 A080944
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Feb 25 2003
|
|
|
Search completed in 0.002 seconds
|
