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 A190511 #19 Apr 03 2025 13:27:17
%S A190511 1,3,5,7,10,12,14,16,19,21,23,25,28,30,32,34,37,39,41,43,45,48,50,52,
%T A190511 54,57,59,61,63,66,68,70,72,75,77,79,81,83,86,88,90,92,95,97,99,101,
%U A190511 104,106,108,110,113,115,117,119,121,124,126,128,130,133,135,137,139,142,144,146,148,151,153,155,157,159,162,164,166,168,171,173
%N A190511 n+[nr/u]+[ns/u]+[nt/u]; r=golden ratio, s=r^2, t=r^3, u=r^4.
%C A190511 A190508: a(n)=n+[nr]+[nr^2]+[nr^3]
%C A190511 A190509: b(n)=[n/r]+n+[nr]+[nr^2]
%C A190511 A054770: c(n)=[n/r^2]+[n/r]+n+[nr]
%C A190511 A190511: d(n)=[n/r^3]+[n/r^2]+[n/r]+n
%C A190511 Are the differences between successive terms always 2 or 3? - _Harvey P. Dale_, Apr 03 2025
%H A190511 Harvey P. Dale, <a href="/A190511/b190511.txt">Table of n, a(n) for n = 1..1000</a>
%F A190511 a(n) = A022839(n)-1. - _Michel Dekking_, May 04 2019
%t A190511 (See A190508.)
%t A190511 Module[{g=GoldenRatio,g4},g4=g^4;Table[n+Floor[(n*g)/g4]+Floor[(n*g^2)/g4]+Floor[(n*g^3)/g4],{n,80}]] (* _Harvey P. Dale_, Apr 03 2025 *)
%Y A190511 Cf. A190508, A190509, A054770.
%K A190511 nonn
%O A190511 1,2
%A A190511 _Clark Kimberling_, May 11 2011