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 A214067 #11 Feb 18 2024 07:57:36
%S A214067 0,5,12,17,25,30,37,42,50,55,62,67,75,80,87,92,100,105,112,117,125,
%T A214067 130,137,142,150,155,162,167,175,180,187,192,200,205,212,217,225,230,
%U A214067 237,242,250,255,262,267,275,280,287,292,300
%N A214067 a(n) = [(5/2)*[(5/2)*n]], where [ ] = floor.
%C A214067 Also, numbers congruent to {0,5,12,17} mod 25.
%H A214067 Clark Kimberling, <a href="/A214067/b214067.txt">Table of n, a(n) for n = 0..1000</a>
%H A214067 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1,-1).
%F A214067 a(n) = (50*n - 7 + 5*(-1)^n + (1 + i)*(-i)^n + (1 - i)*i^n)/8, where i = sqrt(-1).
%F A214067 a(n) = a(n-1) + a(n-4) - a(n-5).
%F A214067 G.f.: f(x)/g(x), where f(x) = 5*x + 7*x^2 + 5*x^3 + 8*x^4 and g(x) = (1 + x + x^2 + x^3)*(1 - x)^2
%t A214067 f[n_]:=Floor[(5/2)Floor[5n/2]];
%t A214067 t=Table[f[n],{n,0,70}]
%Y A214067 Cf. A214066, A214068.
%K A214067 nonn,easy
%O A214067 0,2
%A A214067 _Clark Kimberling_, Jul 20 2012