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.
%I A066628 #15 Dec 07 2024 17:11:53
%S A066628 0,0,0,0,1,0,1,2,0,1,2,3,4,0,1,2,3,4,5,6,7,0,1,2,3,4,5,6,7,8,9,10,11,
%T A066628 12,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,0,1,2,3,4,5,
%U A066628 6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30
%N A066628 a(n) = n - the largest Fibonacci number <= n.
%H A066628 Harry J. Smith, <a href="/A066628/b066628.txt">Table of n, a(n) for n = 0..1000</a>
%F A066628 a(n) = n - A087172(n). - _Michel Marcus_, Feb 02 2016
%t A066628 f[n_] := Block[{k = 1}, While[Fibonacci[k] <= n, k++ ]; Return[n - Fibonacci[k - 1]]]; Table[ f[n], {n, 0, 100} ]
%o A066628 (PARI) a(n) = { my(k=0); while(fibonacci(k) <= n, k++); n-fibonacci(k-1) } \\ _Harry J. Smith_, Mar 14 2010
%Y A066628 Cf. A000045, A087172.
%K A066628 nonn
%O A066628 0,8
%A A066628 _Amarnath Murthy_, Dec 25 2001
%E A066628 Corrected and extended by _Robert G. Wilson v_, Dec 28 2001