login
a(n) = Sum_{k >= 1} floor(n*phi^(2-k)).
2

%I #13 Jul 06 2019 11:32:35

%S 2,6,9,13,18,21,26,29,34,38,41,46,51,55,59,62,67,72,75,79,83,88,93,96,

%T 100,105,108,113,116,122,126,129,133,139,143,148,151,155,160,163,167,

%U 171,176,180,184,188,194,198,202,205,210,214,217,222,226

%N a(n) = Sum_{k >= 1} floor(n*phi^(2-k)).

%H C. Kimberling, <a href="https://www.jstor.org/stable/2975195">Problem 10520</a>, Amer. Math. Mon. 103 (1996) p. 347.

%Y Cf. A001622 (phi), A020961.

%K nonn

%O 1,1

%A _Clark Kimberling_

%E Title improved and more terms from _Sean A. Irvine_, May 05 2019