login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004926 a(n) = floor(n*phi^11), where phi is the golden ratio, A001622. 20

%I #14 Aug 28 2023 08:28:18

%S 0,199,398,597,796,995,1194,1393,1592,1791,1990,2189,2388,2587,2786,

%T 2985,3184,3383,3582,3781,3980,4179,4378,4577,4776,4975,5174,5373,

%U 5572,5771,5970,6169,6368,6567,6766

%N a(n) = floor(n*phi^11), where phi is the golden ratio, A001622.

%H G. C. Greubel, <a href="/A004926/b004926.txt">Table of n, a(n) for n = 0..10000</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/NonRecursions.html">Non Recursions</a>

%H <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>

%t Floor[GoldenRatio^(11)*Range[0, 60]] (* _G. C. Greubel_, Aug 27 2023 *)

%o (Magma) [Floor((199+89*Sqrt(5))*n/2): n in [0..60]]; // _G. C. Greubel_, Aug 27 2023

%o (SageMath) [floor(golden_ratio^(11)*n) for n in range(61)] # _G. C. Greubel_, Aug 27 2023

%Y Cf. A004919, A004920, A004921, A004922, A004923, A004924, A004925.

%Y Cf. A004927, A004928, A004929, A004930, A004931, A004932, A004933.

%Y Cf. A004934, A004935, A004976, A066096, A090909.

%Y Cf. A001622.

%K nonn

%O 0,2

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)