[seqfan] A000108(n) ≡ 1 (mod 6)

[Antti Karttunen]

Ed, I'm trying to add to
https://oeis.org/draft/A265210
the following line to Crossrefs-section:
Cf. A037096 (numbers constructed from the inverse case, base 2 digits of 3^n).

but I keep on getting "502 Proxy Error from OEIS-server".

In any case, I guess that the same general process that forces the
columns in A037096 to be periodic applies also in your case.

Best,

Antti


On Sat, Dec 5, 2015 at 10:34 AM,  <seqfan-request at list.seqfan.eu> wrote:

> Message: 9
> Date: Sat, 5 Dec 2015 02:28:34 -0600
> From: "L. Edson Jeffery" <lejeffery2 at gmail.com>
> To: seqfan at list.seqfan.eu
> Subject: [seqfan] Re: A000108(n) ≡ 1 (mod 6)
> Message-ID:
>         <CAGRLqMhzvUKBxVUronzwKVj+k9isrQajzWe0=EucDgN4M-Nw5g at mail.gmail.com>
> Content-Type: text/plain; charset=UTF-8
>
> Robert,
>
> In one of your other posts on this topic (see
> http://list.seqfan.eu/pipermail/seqfan/2015-November/015590.html), you gave
> a probabilistic argument. I wanted to try another version here.
>
> I just proposed A265210 which is an irregular triangle in which row n gives
> the base 3 digits of 2^n in reverse order. The first few rows are
>
> {1},
> {2},
> {1, 1},
> {2, 2},
> {1, 2, 1},
> {2, 1, 0, 1},
> {1, 0, 1, 2},
> {2, 0, 2, 1, 1},
> ...
>
> Let the columns be indexed by k=1,2,... .
>
> Conjecture: (i) The sequence in column k is periodic with period p(k) =
> 2*3^(k-1); (ii) The numbers 0,1,2 appear with equal frequency in each
> column (except column 1 which obviously contains only the numbers 1,2 with
> equal frequency).
>
> Assume that the conjecture is true. I imagined, after studying the triangle
> to some extent, that the distribution of the 2's throughout the triangle is
> such that, for fixed k, removing all rows which contain a 2 in column k
> does not affect the relative frequency of the digits 0,1,2 in columns k+1,
> k+2, ..., so let's further assume that is the case. Clearly, upon removing
> those rows, all columns remain periodic (proof is easy). Of course, the
> period is reduced.
>
> If we now iterate the process of removing all rows which contain a 2 in
> column k, for each k in {1,...,infinity}, then we will have removed
>
> 1/2 + 1/3 + 1/9 + 1/27 + ...
>
> of the rows. Since
>
> 1/2 + Sum_{j=1..infinity} 1/3^j = 1,
>
> I think we will have removed either all but finitely many of the rows or
> all rows except for some set of measure zero. Of course, the former case
> means that the set of all m such that 2^m is a sum of powers of 3 must be
> finite which is what we'd like to know. I don't think the latter case helps
> at all, but I see no way around it.
>
> Could proof of that conjecture be any easier than the original problem?
>
> Ed Jeffery
>
>