|
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
|
|
| 1, 1, 2, 6, 12, 84, 252, 252, 504, 2520, 17640, 52920, 52920, 52920, 52920, 476280, 952560, 952560, 4762800, 61916400, 185749200, 928746000, 928746000, 928746000, 928746000, 4643730000, 13931190000, 13931190000, 13931190000, 13931190000
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
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.
|
|
MAPLE
|
contai := proc(a, n) verify(convert(n, base, 2), convert(a, base, 2), sublist) ; end: A141288 := proc(n) option remember; local k ; if n= 0 then 1; else for k from 1 do if contai(k*procname(n-1), n) then RETURN( k*procname(n-1) ) ; fi; od: fi; end: seq(A141288(n), n=0..40) ; [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 19 2009]
|
|
CROSSREFS
|
Sequence in context: A166470 A144144 A129085 this_sequence A062954 A038787 A144098
Adjacent sequences: A141285 A141286 A141287 this_sequence A141289 A141290 A141291
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Leroy Quet Aug 01 2008
|
|
EXTENSIONS
|
Extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 19 2009
|
|
|
Search completed in 0.002 seconds
|
