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!)
A116953 a(n) = Floor[1/2((1-2/Sqrt[3])^n+(1-2/Sqrt[3])^n)] 0

%I #5 Mar 30 2012 17:34:20

%S 1,1,2,5,10,23,50,107,232,500,1078,2323,5007,10789,23248,50092,107934,

%T 232566,501111,1079745,2326528,5012972,10801454,23273900,50148285,

%U 108054537

%N a(n) = Floor[1/2((1-2/Sqrt[3])^n+(1-2/Sqrt[3])^n)]

%C A Binet sequence solution with ratio =(2+Sqrt[3])/Sqrt[3] ( called a trident sequence after the graphic it comes from).

%t Needs["DiscreteMath`RSolve`"]; Clear[f]; f[n_Integer] = Module[{a}, a[n] /. RSolve[{a[n] == 2*a[n - 1] + a[n - 2]/3, a[0] == 1, a[1] == 1}, a[n], n][[1]] // Simplify] // ToRadicals Table[Floor[N[f[n]]], {n, 0, 25}]

%K nonn

%O 0,3

%A _Roger L. Bagula_, Apr 03 2006

%E Edited by _N. J. A. Sloane_, May 04 2006

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 27 02:24 EDT 2024. Contains 372004 sequences. (Running on oeis4.)