A073450 Triangle T(j,k) = remainder of Fibonacci(j) divided by Fibonacci(k), for 3 < j and 2 < k < j.

1, 1, 2, 0, 2, 3, 1, 1, 3, 5, 1, 0, 1, 5, 8, 0, 1, 4, 2, 8, 13, 1, 1, 0, 7, 3, 13, 21, 1, 2, 4, 1, 11, 5, 21, 34, 0, 0, 4, 0, 1, 18, 8, 34, 55, 1, 2, 3, 1, 12, 2, 29, 13, 55, 89, 1, 2, 2, 1, 0, 20, 3, 47, 21, 89, 144, 0, 1, 0, 2, 12, 1, 32, 5, 76, 34, 144, 233, 1, 0, 2, 3, 12, 0, 1, 52, 8, 123

Offset

0,3

Comments

The zero values T(j,1) and T(j,2) have been omitted, so the first row consists of T(4,3). - A072523(n) = sum(T(n,k), k = 3, ..., n-1) for n > 3.

Links

Table of n, a(n) for n=0..87.

Example

a(0) = Fibonacci(4) mod Fibonacci(3) = 3 mod 2 = 1; a(2) = Fibonacci(5) mod Fibonacci(4) = 5 mod 3 = 2.

Prog

(PARI) for(j=4, 16, for(k=3, j-1, print1(fibonacci(j)%fibonacci(k), ", ")))

Crossrefs

Cf. A072523.

Sequence in context: A330240 A330237 A231154 * A284592 A071447 A063514

Adjacent sequences: A073447 A073448 A073449 * A073451 A073452 A073453

Keyword

easy,nonn,tabl

Author

Klaus Brockhaus, Aug 01 2002

Status

approved