Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a21e20cc39cb15db

Jump to content

Talk:Wythoff array

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 10 years ago by Billymac00 in topic OEIS sequences

Small error in determining a particular value in the array

[edit]

"...In particular the entry A_{m,n} of the array is the mth smallest number whose Zeckendorf representation begins with the nth Fibonacci number."

I changed this to the (n+1)th value instead. I'm pretty new to editing Wikipedia, but I think this is right. Try 11; the old formula would have us believe that 11 is the 2nd smallest number whose Zeckendorf representation begins with the 3rd Fibonacci number. However, whether one takes the Fibonacci numbers to start at 0 OR 1, it doesn't work. No sum of non-consectuve Fibonacci numbers starting at F3=1 or F3=2 will equal 11. However the (3+1)th Fibonacci number F4=3 does work, because 3+8=11.  Preceding unsigned comment added by RemyWay (talkcontribs) 21:02, 7 March 2016 (UTC)Reply

OEIS sequences

[edit]

There are many related sequences. One is A095081. This link speaks to Wythoff being a classic OEIS sequence in great detail: Classic Sequences (OEIS)--Billymac00 (talk) 12:55, 27 March 2016 (UTC)Reply