This is again written during the channeling. Together with the 4th part of the confession series. Confession4

This post is about the ideas for the analysis. PS. Here’s a poem about primes.delirium33

Lets now consider the function of the primes. Lets now, for all primes lets find the corresponding R-sequence number. For that we could find the polynomial describing this sequence. Then, for a specific number of primes we could find these sequences, differentiate and integrate like Euler did, and then apply m=1/2 like Euler did for binominal things to attack the potential functions. I don’t like it because it does not want to touch the far deduction but launches and handles the attacks seen at first sight. But it might be useful for some.

Here, a couple of good things, I think. Firstly, R-sequence is just R(n) sequence from now on. The thing is that R-sequence know from what I had presented years ago is all about 3. So it’s R(3). There could be R(5), R(7), R(11) and R(p) for every prime. Of course, the character would be slightly different, i.e. the newly created R-sided numbers would not be similar to those known before. So, there’d be a need to redefine what is really RED and why it is red. R(3) helped us a lot, but R(5) et al will help us as well. From now on, R(n). This is indeed a great feeling. Will be introduced later on but just giving you a more general insight before I will write something. As written in the poem, this sequences are all very close (the same distance) to the prime numbers.

**RED SEQUENCES (generalized)**

R(3) is {3,9,10,27,28,30,81,..}

R(5) is {5,25,26,34,35,38 (until it reaches the Y val of 3-dim number 125, then next row}

…

That is one. Indeed, these numbers are inverse of what I have been recently doing with this rainbow colouring a . The inverse or something similar to the inverse. Also, worth analyzing.

Another thing to think about is whether the generalized notion of the R sequences will cover the entire integer set of L-sided numbers or R(3) (to which I will be often referring to as if it was L-sided too).

It is interesting to learn more about the R-paths which I am now going to shortly describe. For every number, e.g. for 66, we will find nondistinct divisors, i.e. (in this example) 66=2*3*11, then in $latex \Xi$ matrix we will start to divide by the smallest of the divisors, finding in our way, 33, then (iteratively) 11. So in case of 5*7*17*19, we’d find 5*7*17, then 5*7, then 5, being the smallest divisor. 5*7*17-5*7-5 would be the R path for the very number (also including the number itself). Could also be extended to other ordering of dividing of the initial number.

The last note that I should make today so that I have all these for the later analysis. Could we solve the problems regarding the interaction of the R sequences? Can we solve, for instance, this task: , where means R(k) sequence.