[seqfan] Re: Hofstadter-Conway $10,000 Sequence
davidwwilson at comcast.net
Tue Jul 7 23:59:43 CEST 2009
----- Original Message -----
From: <franktaw at netscape.net>
To: <seqfan at seqfan.eu>
Sent: Tuesday, July 07, 2009 4:04 PM
Subject: [seqfan] Hofstadter-Conway $10,000 Sequence
>I just submitted a new sequence:
> %S A162598
> %T A162598
> %U A162598
> %N A162598 Ordinal transform of modified A051135.
> %C A162598 This is a fractal sequence.
> %C A162598 It appears that each group of 2^k terms starts with 1 and
> ends with the remaining powers of two from 2^k down to 2^1.
> %F A162598 Let b(1) = 1, b(n) = A051135(n) for n > 1. Then a(n) is the
> number of b(k) that equal b(n) for 1 <= k <= n: sum( 1, 1<=k<=n and
> a(k)=a(n) ).
> %Y A162598 Cf. A004001,A051135.
> %K A162598 nonn
> %O A162598 1,3
> The conjecture here might, if established, throw some light on the
> behavior of the Hofstadter-Conway $10,000 Sequence.
> (The ordinal transform is the transform specified by the second
> sentence in the formula line. As noted in A051135, the modified
> sequence here called b(n) is identical to its lower-trimmed
> subsequence; the ordinal transform of such a sequence is a fractal
> sequence, and vice versa.)
> Franklin T. Adams-Watters
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan