So what are 3*1, 3*4, and 3*7 mod 9? You're almost there.

[QUOTE=CRGreathouse;225220]So what are 3*1, 3*4, and 3*7 mod 9? You're almost there.[/QUOTE]

they all come back to 3 so assuming my idea is correct the first column must always be 3 hence we can map it through the diagonals and get the modulo for the Mersenne primes to come.

though why multiply them in the next in the row they cover almost all the same range.

the hard part is how to map it accurately without knowing it.

[QUOTE=science_man_88;225221]they all come back to 3 so assuming my idea is correct the first column must always be 3[/QUOTE]

Right. This is a [i]proof[/i] that the first column is always 3 where it exists. (We don't know if there are infinitely many rows because we don't know if there are infinitely many Mersenne primes.)

[QUOTE=science_man_88;225221]hence we can map it through the diagonals and get the modulo for the Mersenne primes to come.[/QUOTE]

You can't tell anything about future Mersenne primes because no matter what they are, you'll get a 3. Right?

[QUOTE=CRGreathouse;225212]Ah, I think I have it. Together with my above code take
[code]ProdK(k)=k--;vector(#A43-k,i,prod(j=0,k,drMersenne(A43[i+j]))%9)[/code]
which gives the digital roots of the product of k consecutive [B][U][I][COLOR="Red"]Mersenne numbers[/COLOR][/I][/U][/B]. So ProdK(1) gives [url=http://oeis.org/classic/A135928]A135928[/url](n), ProdK(2) gives [url=http://oeis.org/classic/A010888]A010888[/url]([url=http://oeis.org/classic/A165223]A165223[/url](n)), etc.

Then you have[/quote]

you say Mersenne numbers ... any other patterns in it if it is for Mersenne primes such that it would help predict modulo ?

can this be turned into a triangle by turning it 45 degrees ?

I see more weird things in the diagonals that would become rows of this triangle not saying they tell much lol.

[QUOTE=science_man_88;225224]you say Mersenne numbers ... any other patterns in it if it is for Mersenne primes such that it would help predict modulo ?[/QUOTE]

I'm sorry, I meant Mersenne primes. The same pattern would hold for Mersenne numbers with exponents relatively prime to 6.

You *know* that you can't predict anything about any sequence that has exponents that are relatively prime to 6, because you're already shown how those sequences have to start. It cuts both ways: because the proof shows that all such sequences will have the same behavior, you can't use that behavior to predict anything within those sequences.

[QUOTE=science_man_88;225228]can this be turned into a triangle by turning it 45 degrees ?[/QUOTE]

Sure, whatever you want. Feel free to modify my code as needed.

[code]>for(k=1,15,print(k"\t"ProdK(k)))
1 [3, 7, [COLOR="Red"]4[/COLOR], 1, 1, [COLOR="Yellow"]4[/COLOR], 1, 1, 1, 4, 4, 1, 4, 1, 1, 1, 1, 1, 4, 1, 4, 4, 4, 4, 4, 1, 1, 4, 1, 1, 1, 4, 4, 1, 4, 4, 4, 4, 1]
2 [3, [COLOR="red"]1, 4,[/COLOR] 1, [COLOR="yellow"]4, 4,[/COLOR] 1, 1, 4, 7, 4, 4, 4, 1, 1, 1, 1, 4, 4, 4, 7, 7, 7, 7, 4, 1, 4, 4, 1, 1, 4, 7, 4, 4, 7, 7, 7, 4]
3 [[COLOR="red"]3, 1, 4,[/COLOR][COLOR="yellow"] 4, 4, 4, [/COLOR]1, 4, 7, 7, 7, 4, 4, 1, 1, 1, 4, 4, 7, 7, 1, 1, 1, 7, 4, 4, 4, 4, 1, 4, 7, 7, 7, 7, 1, 1, 7]
4 [[COLOR="Red"]3, 1,[/COLOR] [COLOR="Yellow"]7, 4, 4, 4[/COLOR], 4, 7, 7, 1, 7, 4, 4, 1, 1, 4, 4, 7, 1, 1, 4, 4, 1, 7, 7, 4, 4, 4, 4, 7, 7, 1, 1, 1, 4, 1]
5 [[COLOR="Red"]3[/COLOR], [COLOR="yellow"]4, 7, 4, 4[/COLOR], 7, 7, 7, 1, 1, 7, 4, 4, 1, 4, 4, 7, 1, 4, 4, 7, 4, 1, 1, 7, 4, 4, 7, 7, 7, 1, 4, 4, 4, 4]
6 [[COLOR="Yellow"]3, 4, 7, 4[/COLOR], 7, 1, 7, 1, 1, 1, 7, 4, 4, 4, 4, 7, 1, 4, 7, 7, 7, 4, 4, 1, 7, 4, 7, 1, 7, 1, 4, 7, 7, 4]
7 [[COLOR="Yellow"]3, 4, 7[/COLOR], 7, 1, 1, 1, 1, 1, 1, 7, 4, 7, 4, 7, 1, 4, 7, 1, 7, 7, 7, 4, 1, 7, 7, 1, 1, 1, 4, 7, 1, 7]
8 [[COLOR="yellow"]3, 4[/COLOR], 1, 1, 1, 4, 1, 1, 1, 1, 7, 7, 7, 7, 1, 4, 7, 1, 1, 7, 1, 7, 4, 1, 1, 1, 1, 4, 4, 7, 1, 1]
9 [[COLOR="Yellow"]3[/COLOR], 7, 4, 1, 4, 4, 1, 1, 1, 1, 1, 7, 1, 1, 4, 7, 1, 1, 1, 1, 1, 7, 4, 4, 4, 1, 4, 7, 7, 1, 1]
10 [3, 1, 4, 4, 4, 4, 1, 1, 1, 4, 1, 1, 4, 4, 7, 1, 1, 1, 4, 1, 1, 7, 7, 7, 4, 4, 7, 1, 1, 1]
11 [3, 1, 7, 4, 4, 4, 1, 1, 4, 4, 4, 4, 7, 7, 1, 1, 1, 4, 4, 1, 1, 1, 1, 7, 7, 7, 1, 4, 1]
12 [3, 4, 7, 4, 4, 4, 1, 4, 4, 7, 7, 7, 1, 1, 1, 1, 4, 4, 4, 1, 4, 4, 1, 1, 1, 1, 4, 4]
13 [3, 4, 7, 4, 4, 4, 4, 4, 7, 1, 1, 1, 4, 1, 1, 4, 4, 4, 4, 4, 7, 4, 4, 4, 4, 4, 4]
14 [3, 4, 7, 4, 4, 7, 4, 7, 1, 4, 4, 4, 4, 1, 4, 4, 4, 4, 7, 7, 7, 7, 7, 7, 7, 4]
15 [3, 4, 7, 4, 7, 7, 7, 1, 4, 7, 7, 4, 4, 4, 4, 4, 4, 7, 1, 7, 1, 1, 1, 1, 7][/code]

here's one such thing I see.

SLSN, for that one. Since you're going along the antidiagonals there aren't any more terms to check...

[QUOTE=CRGreathouse;225234]SLSN, for that one. Since you're going along the antidiagonals there aren't any more terms to check...[/QUOTE]

SLSN ?