cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A020960 #13 Jul 06 2019 11:32:35
%S A020960 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 A020960 100,105,108,113,116,122,126,129,133,139,143,148,151,155,160,163,167,
%U A020960 171,176,180,184,188,194,198,202,205,210,214,217,222,226
%N A020960 a(n) = Sum_{k >= 1} floor(n*phi^(2-k)).
%H A020960 C. Kimberling, <a href="https://www.jstor.org/stable/2975195">Problem 10520</a>, Amer. Math. Mon. 103 (1996) p. 347.
%Y A020960 Cf. A001622 (phi), A020961.
%K A020960 nonn
%O A020960 1,1
%A A020960 _Clark Kimberling_
%E A020960 Title improved and more terms from _Sean A. Irvine_, May 05 2019