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 A004919 #50 Aug 23 2023 12:20:28
%S A004919 0,6,13,20,27,34,41,47,54,61,68,75,82,89,95,102,109,116,123,130,137,
%T A004919 143,150,157,164,171,178,185,191,198,205,212,219,226,233,239,246,253,
%U A004919 260,267,274,281,287,294,301,308
%N A004919 a(n) = floor(n*phi^4), where phi is the golden ratio, A001622.
%C A004919 The golden section or golden ratio is now usually denoted by "phi", but it in the older literature it was more often denoted by "tau." - _N. J. A. Sloane_, Feb 17 2013
%H A004919 Vincenzo Librandi, <a href="/A004919/b004919.txt">Table of n, a(n) for n = 0..1000</a>
%H A004919 A. J. Hildebrand, Junxian Li, Xiaomin Li, and Yun Xie, <a href="https://arxiv.org/abs/1809.08690">Almost Beatty Partitions</a>, arXiv:1809.08690 [math.NT], 2018.
%H A004919 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F A004919 a(n) = 2*n + floor(3*n*tau). [Formula corrected by _Charles R Greathouse IV_, Mar 11 2011]
%t A004919 With[{c=GoldenRatio^4},Floor[c*Range[0,50]]] (* _Harvey P. Dale_, Apr 11 2012 *)
%o A004919 (Python)
%o A004919 from math import isqrt
%o A004919 def A004919(n): return (3*n+isqrt(45*n**2)>>1)+(n<<1) # _Chai Wah Wu_, Aug 17 2022
%o A004919 (Magma) [Floor((7+3*Sqrt(5))*n/2): n in [0..60]]; // _G. C. Greubel_, Aug 22 2023
%o A004919 (SageMath) [floor(golden_ratio^4*n) for n in range(61)] # _G. C. Greubel_, Aug 22 2023
%Y A004919 Cf. A004920, A004921, A004922, A004923, A004924, A004925, A004926.
%Y A004919 Cf. A004927, A004928, A004929, A004930, A004931, A004932, A004933.
%Y A004919 Cf. A004934, A004935, A004976, A066096, A090909.
%Y A004919 Cf. A000201, A001950.
%K A004919 nonn
%O A004919 0,2
%A A004919 _N. J. A. Sloane_