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!)
A214999 Power floor sequence of sqrt(5). 5

%I #5 Nov 15 2012 21:24:39

%S 2,4,8,17,38,84,187,418,934,2088,4668,10437,23337,52183,116684,260913,

%T 583419,1304564,2917093,6522818,14585464,32614088,72927317,163070438,

%U 364636584,815352188,1823182917,4076760937,9115914583

%N Power floor sequence of sqrt(5).

%C See A214992 for a discussion of power floor sequence and the power floor function, p1(x) = limit of a(n,x)/x^n. The present sequence is a(n,r), where r = sqrt(5), and the limit p1(r) = 1.4935514451954997630823098687087959696356...

%H Clark Kimberling, <a href="/A214999/b214999.txt">Table of n, a(n) for n = 0..250</a>

%F a(n) = [x*a(n-1)], where x=sqrt(5), a(0) = [x].

%e a(0) = [r] = 2, where r = sqrt(5); a(1) = [2*r] = 4; a(2) = [4*r] = 8.

%t x = Sqrt[5]; z = 30; (* z = # terms in sequences *)

%t f[x_] := Floor[x]; c[x_] := Ceiling[x];

%t p1[0] = f[x]; p2[0] = f[x]; p3[0] = c[x]; p4[0] = c[x];

%t p1[n_] := f[x*p1[n - 1]]

%t p2[n_] := If[Mod[n, 2] == 1, c[x*p2[n - 1]], f[x*p2[n - 1]]]

%t p3[n_] := If[Mod[n, 2] == 1, f[x*p3[n - 1]], c[x*p3[n - 1]]]

%t p4[n_] := c[x*p4[n - 1]]

%t Table[p1[n], {n, 0, z}] (* A214999 *)

%t Table[p2[n], {n, 0, z}] (* A215091 *)

%t Table[p3[n], {n, 0, z}] (* A218982 *)

%t Table[p4[n], {n, 0, z}] (* A218983 *)

%Y Cf. A214992, A215091, A218982, A218983.

%K nonn,easy

%O 0,1

%A _Clark Kimberling_, Nov 10 2012

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 26 05:19 EDT 2024. Contains 371989 sequences. (Running on oeis4.)