2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 7, 6, 8, 7, 9, 8, 10, 9, . . .

[Simon Plouffe]

Hello,

just a note about the sequence,

here is another one, :

  [((n+1)/2)], n=1,2,3,4,...

which is 1,1,2,2,3,3,4,4,5,5,6,6,... and [ ] is the floor function.

It also has this generating function : 1/(x+1)/(x-1)^2
which is a 3rd order recurrence too.

The one you mention is nicer I must say since the terms
that represent 2 * N are mixed up.

Simon Plouffe