Two puzzles(?)

[Joseph Biberstine]

To hv,
	I feel in the case where a generator having (subjective, yes)
relatively low complexity can found to satisfy some output, the
information you want isn't lacking.  Supposing a sequence is not
algorithmically random that information is, at worst, only hiding ;)

To zak,
	First puzzle seq is A, second is B.  For as many terms as given, where
c[] is the natural complement, it is easy to find that the following
identities hold:

	A = 3*c[B]
	B = 2*c[A]
	thus
	A = 3*c[2*c[A]]
	B = 2*c[3*c[B]]	

	As far as a closed formula..?  I have no experience closing this type
of relation.

- JRB

hv at crypt.org wrote:
> zak seidov <zakseidov at yahoo.com> wrote:
> :Are these two worth submitting to OEIS?
> :Thanks, Zak
> :
> :3,9,15,18,21,27,33,39,45,51,54,57,63,69,75,81,87,90,93,99,105,108,111,117,123,126,129,135,141,147,153,159,162,165,171,177,183,189,195,198
> :(hint: all are miltiples of 3)
> :
> :2,4,8,10,12,14,16,20,22,24,26,28,32,34,38,40,44,46,48,50,52,56,58,60,62,64,68,70,72,74,76,80,82,84,86,88,92,94,96,98,100,104,106,110,112,116,118,120,122,124,128,130,132,134,136,140,142,144,146,148,152,154,156,158,160,164,166,168,170,172,176,178,182,184,188,190,192,194,196,200
> :(hint: all are even) 
> 
> My answer would be "insufficient information" - to me, it is the rule that
> determines whether it is interesting enough to include, not the sequence
> itself.
> 
> Hugo