|
Search: id:A080940
|
|
|
| A080940 |
|
Smallest divisor of n which is less n and also a suffix of n in the binary representation; a(n)=0 if no such divisor exists. |
|
+0
10
|
|
| 0, 0, 1, 0, 1, 2, 1, 0, 1, 2, 1, 4, 1, 2, 1, 0, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 0, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 16, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 0, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 16, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 32, 1, 2, 1, 4, 1, 2, 1, 8
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
By definition, identical to A006519 except that a(2^k) = 0 for all k.
a(3*2^k)=2^k and a(m)<2^k for m<3*2^k (see A007283).
|
|
EXAMPLE
|
n=6='110', divisors<6: 1='1', 2='10', and 3='11', therefore a(6)=2='10';
n=7='111', divisors<7: 1='1', therefore a(7)=1;
n=8='1000', divisors<8: 1='1', 2='10', and 4='100', therefore a(8)=0.
|
|
CROSSREFS
|
Cf. A007088, A000079, A080941, A080942, A006519.
Sequence in context: A087991 A076092 A080468 this_sequence A080941 A114021 A053616
Adjacent sequences: A080937 A080938 A080939 this_sequence A080941 A080942 A080943
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Feb 25 2003 Hugo
|
|
|
Search completed in 0.002 seconds
|
