|
Search: id:A141288
|
|
|
| A141288 |
|
a(0)=1. a(n) = smallest positive multiple of a(n-1) such that a(n) contains the binary representation of n at least once somewhere within its binary representation. |
|
+0
1
|
| |
|
|
OFFSET
|
0,3
|
|
|
EXAMPLE
|
6 in binary is 110. Checking the multiples of a(5)=84: 1*84 = 84 = 1010100 in binary. 110 does not occur. 2*84 = 168 = 10101000 in binary. 110 does not occur. But 3*84 = 252 = 11111100 in binary. 110 occurs in this like so: 1111(110)0. So a(6) = 252.
|
|
CROSSREFS
|
Sequence in context: A107763 A144144 A129085 this_sequence A062954 A038787 A144098
Adjacent sequences: A141285 A141286 A141287 this_sequence A141289 A141290 A141291
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Aug 01 2008
|
|
|
Search completed in 0.002 seconds
|
