login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A104797 Triangle T(n,k) = Fib(n-k+4)-n-k-3, n>=1, 0<=k<n, read by rows. 1

%I #4 Apr 30 2014 01:30:32

%S 1,3,1,7,3,1,14,7,3,1,26,14,7,3,1,46,26,14,7,3,1,79,46,26,14,7,3,1,

%T 133,79,46,26,14,7,3,1,221,133,79,46,26,14,7,3,1,364,221,133,79,46,26,

%U 14,7,3,1,596,364,221,133,79,46,26,14,7,3,1,972,596,364,221,133,79,46,26

%N Triangle T(n,k) = Fib(n-k+4)-n-k-3, n>=1, 0<=k<n, read by rows.

%C Repeatedly writing the sequence A001924 backwards.

%e First few rows of the triangle are:

%e 1;

%e 3, 1;

%e 7, 3, 1;

%e 14, 7, 3, 1;

%e 26, 14, 7, 3, 1;

%e 46, 26, 14, 7, 3, 1;

%e ...

%Y Row sums are in A014162.

%Y Cf. A104732.

%K nonn,tabl

%O 1,2

%A _Gary W. Adamson_, Mar 26 2005

%E Edited by _Ralf Stephan_, Apr 05 2009

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)