(adsbygoogle = window.adsbygoogle || []).push({}); Certain and Curious Number Sequence (w/ primes)

This is the number sequence a(x) whose output is determined by the greatest integer divisor n of any factorization of a with the additional rule that if an element is repeated in the factorization, the factorization must be thrown out.

EX: a(56). The factorizations are 1*56, 2*28, 4*14, 7*8, 7*2*4. Any of these are valid factorizations, take the greatest element of each and you have the output elements 56, 28, 14, 8, 7.

This sequence is consequential to the series below:

[itex]∏_{n=1}^T(1+n^{-1})[/itex]

Which is:

(1+1)(1+1/2)(1+1/3)(1+1/4)...

Now obviously, this function boils down to T+1, but we don't want to leave it at that. If you manually multiply out the terms, you'll get, for example for t=4, this:

1+1+1/2+1/2+1/3+1/3+1/4+1/4+1/6+1/6+1/8+1/8+1/12+1/12+1/24+1/24=5

As you see, the expansion of the series for term T is equivalent to adding all of the reciprocals of the elements of the function on a graph of our curious number sequence graph below or on the line y=T, and then multiplying the result by 2, due to how we defined the function in the first place.

What I'm asking for is "where is there more information and studies on this (relatively minimalistic) function?", although any further communal observations would be equally helpful.Here is the real meat of what I've been able to casually glean with my modest abilities:

1. No elements exists above the line of y=x.

2. No elements exist below the line of y=infa(x) where infa(x) is the inverse of the factorial (sorry, I don't know my terminology).

3. The addition of the reciprocals of the elements' x-values on any y-level with y being any natural number above 1 is 1/2.

4. The elements' x-values, with sole elements (thus existing on the line y=x), are all either primes or square primes, and it includes each and every prime and square prime.

5. I have a couple of results for calculating the elements existing on a line y=x/k for any natural number k with relation to the values existing on y=x (ie the primes and the squares of primes), although it is only a primitive algorithm which produces a subset of the elements.

I would create and display a graph, but I can't really capture what I'm trying to show here on such a surface. I will try to if someone asks for one.

I apologize in advance for any terminology or drunken logic errors, as I don't communicate with other math people very often, and my study in these areas are solitary.

**Physics Forums - The Fusion of Science and Community**

# Certain and Curious Number Sequence

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

Have something to add?

- Similar discussions for: Certain and Curious Number Sequence

Loading...

**Physics Forums - The Fusion of Science and Community**