This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A020941 Main diagonal of Wythoff array: w(n,n)=[ n*tau ]F(n+1)+(n-1)F(n), where tau=(1+sqrt(5))/2, F(n) = Fibonacci numbers. 1

%I

%S 1,7,16,39,84,157,309,555,1042,1919,3338,6011,10713,18321,32228,54730,

%T 95320,165177,278208,478807,803383,1374926,2346070,3917414,6656320,

%U 11284381,18772741,31721202,52672252,88750072,149303520,247281057,415039507,695705846

%N Main diagonal of Wythoff array: w(n,n)=[ n*tau ]F(n+1)+(n-1)F(n), where tau=(1+sqrt(5))/2, F(n) = Fibonacci numbers.

%H C. Kimberling, <a href="http://www.fq.math.ca/Scanned/32-4/kimberling.pdf">The first column of an interspersion</a>, Fibonacci Quarterly 32 (1994), pp. 301-314.

%H C. Kimberling, <a href="http://faculty.evansville.edu/ck6/integer/intersp.html">Interspersions</a>

%H N. J. A. Sloane, <a href="/classic.html#WYTH">Classic Sequences</a>

%t Table[Floor[n*GoldenRatio]Fibonacci[n+1]+(n-1)Fibonacci[n],{n,40}] (* _Harvey P. Dale_, Mar 09 2015 *)

%o (PARI) a(n) = floor(n*(1+sqrt(5))/2)*fibonacci(n+1) + (n-1)*fibonacci(n) \\ _Michel Marcus_, Mar 21 2013

%Y Cf. A000045, A001622, A035513.

%K nonn

%O 1,2

%A _Clark Kimberling_

%E More terms from _Harvey P. Dale_, Mar 09 2015

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

Last modified January 17 17:20 EST 2019. Contains 319250 sequences. (Running on oeis4.)