Triangle read by rows, 0 <= k < n, n >= 2: T(n,k) is the eventual period of the modified Fibonacci sequence x(j) (or 0 if x(j) never enters a cycle) defined as follows: x(0) = 0, x(1) = 1, and for j > 1 x(j) is obtained from x(j-1) + x(j-2) by deleting all occurrences of the digit k in base n.

A306773

Triangle read by rows, 0 <= k < n, n >= 2: T(n,k) is the eventual period of the modified Fibonacci sequence x(j) (or 0 if x(j) never enters a cycle) defined as follows: x(0) = 0, x(1) = 1, and for j > 1 x(j) is obtained from x(j-1) + x(j-2) by deleting all occurrences of the digit k in base n.

Terms

    a(0) =1a(1) =1a(2) =3a(3) =1a(4) =3a(5) =16a(6) =1a(7) =3a(8) =24a(9) =6a(10) =1a(11) =3a(12) =13a(13) =6a(14) =100a(15) =1a(16) =3a(17) =8a(18) =252a(19) =120a(20) =24a(21) =1a(22) =3a(23) =8a(24) =42a(25) =119a(26) =96a(27) =576a(28) =1a(29) =3

External references