Is there even such an algorith?

double counter = 0;

double remWholeNumber = 1.0;
double addWholeNumber = 1.0;
double firstValueInSeq = 1.1;
double remFraction = 10.0;
double addFraction = 10.0;
double X = 0.0; // initialise
double F = ((firstValueInSeq - remWholeNumber) * remFraction);

for (counter = 0.0; counter < 50.0; counter++)
{
  X = ((F) / addFraction) + addWholeNumber;
  F++;

  // increment counter
  counter++;

  printf("%f\n", X);
}

NOTE:
This code was derived from the algorith (very much a mathimatical algorithm from where I'm from):
If Y = 1.0
And Val = 1.1
And Z = 10.0

X = ((((Val - Y) * Z) + 1.0) / Z) + Y

This was placed in my previous solution which was deleted.
I was able to accept my own answer. (It looks like a bug to me Code Project)

The answer to my question was that "it cannot be done mathematically however can be done by making use of string manipulation if this algorith were to be used in a computer program."

Why would I say that this is my answer?
Because the sequence value of 1.10 is the equivalent to the value 1.1; When you count sequentially from 1.1 by incrementing 1.1 each time by 0.1, the value after 1.9 would be 2.0 instead of 1.10 which was what I wanted the next sequential value to be.

It's unclear because we don't know what the algorithm is trying to achieve.

Joking?
No, such algorithm don't exist :-), because this is not a problem to be discussed seriously.

[EDIT]

I don't understand what are you trying to do with X = ((((Val - Y) * Z) + 1) / Z) + Y.
Recursive formula is V[N] := V[N-1] * 0.1, right?
N_th member is 1.1 + N * 0.1.
The loop code is from 1.1 to [some parameter] step 0.1.
Is there anything else I'm missing?

—SA