login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A191361 Number of the diagonal of the Wythoff difference array that contains n. 3
0, 1, -1, -2, 2, -3, 0, -4, -5, -1, -6, -7, 3, -8, -2, -9, -10, 1, -11, -3, -12, -13, -4, -14, -15, 0, -16, -5, -17, -18, -6, -19, -20, 4, -21, -7, -22, -23, -1, -24, -8, -25, -26, -9, -27, -28, 2, -29, -10, -30, -31, -2, -32, -11, -33, -34, -12, -35, -36, -3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Every integer occurs in A191361 (infinitely many times).

Represent the array as {g(i,j): i>=1, j>=1}.  Then for m>=0, (diagonal #m) is the sequence (g(i,i+m)), i>=1;

for m<0, (diagonal #m) is the sequence (g(i+m,i)), i>=1.

LINKS

Table of n, a(n) for n=1..60.

EXAMPLE

Diagonal #0 (the main diagonal) of A080164 is (1,7,26,...), so a(1)=0, a(7)=0, a(26)=0.

MATHEMATICA

r = GoldenRatio; f[n_] := Fibonacci[n];

g[i_, j_] := f[2 j - 1]*Floor[i*r] + (i - 1) f[2 j - 2];

TableForm[Table[g[i, j], {i, 1, 10}, {j, 1, 5}]]

(* A080164, Wythoff difference array *)

a = Flatten[Table[If[g[i, j] == n, j - i, {}], {n, 60}, {i, 50}, {j, 50}]]

(* a=A191361 *)

CROSSREFS

Cf. A080164, A114327, A191360, A191362.

Sequence in context: A079626 A257697 A088864 * A199784 A127466 A099118

Adjacent sequences:  A191358 A191359 A191360 * A191362 A191363 A191364

KEYWORD

sign

AUTHOR

Clark Kimberling, May 31 2011

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 16 02:16 EDT 2019. Contains 327088 sequences. (Running on oeis4.)