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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A177995 Triangle, row sums = odd Fibonacci numbers, A014437. 1
 1, 2, 1, 2, 0, 3, 2, 0, 6, 5, 2, 0, 6, 0, 13, 2, 0, 6, 0, 26, 21, 2, 0, 6, 0, 26, 0, 55, 2, 0, 6, 0, 26, 0, 110, 89, 2, 0, 6, 0, 26, 0, 110, 0, 233, 2, 0, 6, 0, 26, 0, 110, 0, 466, 377, 1, 0, 6, 0, 26, 0, 110, 0, 466, 0, 987 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Row sums = A014437 starting (1, 3, 5, 13, 21, 55, 89, 233, 377,...). The generating triangle M (alternate columns of (1,2,2,2,...) and (1,0,0,0,...) has an eigensequence of (1, 3, 5, 13, 21, 55, 89,...); i.e., the odd Fibonacci numbers; such that M * (1, 1, 3, 5, 13,...) shifts the latter sequence to the left. Sum of n-th row terms = rightmost term of next row. LINKS Table of n, a(n) for n=1..66. FORMULA Let M = an infinite lower triangular matrix with alternate columns of (1,2,2,2,...) and (1,0,0,0,...). Let Q = A014437: (1, 1, 3, 5, 13, 21, 55,...); diagonalized with the rest zeros. Triangle A177995 = M * Q. EXAMPLE First few rows of the triangle = 1; 2, 1; 2, 0, 3; 2, 0, 6, 5; 2, 0, 6, 0, 13; 2, 0, 6, 0, 26, 21; 2, 0, 6, 0, 26, 0, 55; 2, 0, 6, 0, 26, 0, 110, 89; 2, 0, 6, 0, 26, 0, 110, 0, 233; 2, 0, 6, 0, 26, 0, 110, 0, 466, 377; 2, 0, 6, 0, 26, 0, 110, 0, 466, 0, 987; 2, 0, 6, 0, 26, 0, 110, 0, 466, 0, 1974, 1597; ... CROSSREFS Cf. A014437. Sequence in context: A257081 A271484 A199920 * A332104 A238735 A356006 Adjacent sequences: A177992 A177993 A177994 * A177996 A177997 A177998 KEYWORD nonn,tabl AUTHOR Gary W. Adamson, May 16 2010 STATUS approved

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.

Last modified March 2 07:05 EST 2024. Contains 370460 sequences. (Running on oeis4.)