OFFSET
1,1
COMMENTS
See A190361.
Conjecture: linear recurrence with constant coefficients 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1. - Harvey P. Dale, Jan 28 2025
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..10000
FORMULA
MATHEMATICA
r=1; s=(5/4)^(1/2); t=1/s;
f[n_] := n + Floor[n*s/r] + Floor[n*t/r];
g[n_] := n + Floor[n*r/s] + Floor[n*t/s];
h[n_] := n + Floor[n*r/t] + Floor[n*s/t];
Table[f[n], {n, 1, 120}] (* A190361 *)
Table[g[n], {n, 1, 120}] (* A190362 *)
Table[h[n], {n, 1, 120}] (* A190363 *)
Table[n+Floor[n 1/Sqrt[4/5]]+Floor[n Sqrt[5/4]/Sqrt[4/5]], {n, 100}] (* Harvey P. Dale, Jan 28 2025 *)
PROG
(PARI) for(n=1, 100, print1(2*n + floor(n*sqrt(5/4)) + floor(n/4), ", ")) \\ G. C. Greubel, Apr 05 2018
(Magma) [2*n + Floor(n*Sqrt(5/4)) + Floor(n/4): n in [1..100]]; // G. C. Greubel, Apr 05 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, May 09 2011
STATUS
approved
