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 A004924 #21 Aug 25 2023 08:50:09 %S A004924 0,76,152,228,304,380,456,532,608,684,760,836,912,988,1064,1140,1216, %T A004924 1292,1368,1444,1520,1596,1672,1748,1824,1900,1976,2052,2128,2204, %U A004924 2280,2356,2432,2508,2584,2660,2736 %N A004924 a(n) = floor(n*phi^9), where phi is the golden ratio, A001622. %C A004924 The first differences a(n) - a(n-1) generally equal 76 with exceptions for example at n = 77, 153, 229, 305, 381, 457, ..., 5777, 5854, 5930, .... where they equal 77. - _R. J. Mathar_, Jan 11 2008 %H A004924 G. C. Greubel, <a href="/A004924/b004924.txt">Table of n, a(n) for n = 0..10000</a> %H A004924 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/NonRecursions.html">Non Recursions</a> %H A004924 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a> %t A004924 Floor[GoldenRatio^9*Range[0, 60]] (* _G. C. Greubel_, Aug 24 2023 *) %o A004924 (Magma) [Floor((38+17*Sqrt(5))*n): n in [0..60]]; // _G. C. Greubel_, Aug 24 2023 %o A004924 (SageMath) [floor(golden_ratio^9*n) for n in range(61)] # _G. C. Greubel_, Aug 24 2023 %Y A004924 Cf. A004919, A004920, A004921, A004922, A004923, A004925, A004926. %Y A004924 Cf. A004927, A004928, A004929, A004930, A004931, A004932, A004933. %Y A004924 Cf. A004934, A004935, A004976, A066096, A090909. %Y A004924 Cf. A001622 %K A004924 nonn %O A004924 0,2 %A A004924 _N. J. A. Sloane_