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 A004926 #14 Aug 28 2023 08:28:18 %S A004926 0,199,398,597,796,995,1194,1393,1592,1791,1990,2189,2388,2587,2786, %T A004926 2985,3184,3383,3582,3781,3980,4179,4378,4577,4776,4975,5174,5373, %U A004926 5572,5771,5970,6169,6368,6567,6766 %N A004926 a(n) = floor(n*phi^11), where phi is the golden ratio, A001622. %H A004926 G. C. Greubel, <a href="/A004926/b004926.txt">Table of n, a(n) for n = 0..10000</a> %H A004926 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/NonRecursions.html">Non Recursions</a> %H A004926 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a> %t A004926 Floor[GoldenRatio^(11)*Range[0, 60]] (* _G. C. Greubel_, Aug 27 2023 *) %o A004926 (Magma) [Floor((199+89*Sqrt(5))*n/2): n in [0..60]]; // _G. C. Greubel_, Aug 27 2023 %o A004926 (SageMath) [floor(golden_ratio^(11)*n) for n in range(61)] # _G. C. Greubel_, Aug 27 2023 %Y A004926 Cf. A004919, A004920, A004921, A004922, A004923, A004924, A004925. %Y A004926 Cf. A004927, A004928, A004929, A004930, A004931, A004932, A004933. %Y A004926 Cf. A004934, A004935, A004976, A066096, A090909. %Y A004926 Cf. A001622. %K A004926 nonn %O A004926 0,2 %A A004926 _N. J. A. Sloane_