cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-12 of 12 results.

A037158 Convolution of natural numbers n >= 1 with Fibonacci numbers F(k), for k >= -7, with F(-n)=(-1)^(n+1)*F(n).

Original entry on oeis.org

13, 18, 28, 35, 44, 52, 61, 70, 80, 91, 104, 120, 141, 170, 212, 275, 372, 524, 765, 1150, 1768, 2763, 4368, 6960, 11149, 17922, 28876, 46595, 75260, 121636, 196669, 318070, 514496, 832315, 1346552, 2178600, 3524877, 5703194, 9227780, 14930675
Offset: 0

Views

Author

Keywords

Crossrefs

Formula

a(n) = F(n-3)+(11+8*n); G.f. (13-21*x)/((1-x-x^2)*(1-x)^2); 11=L(5) Lucas number;

A137773 Triangular sequence: The Fibonacci sequence on the diagonal, 1's at all other places.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 13, 1, 1, 1, 1, 1, 1, 1, 1, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 55
Offset: 1

Views

Author

Roger L. Bagula and Gary W. Adamson, Apr 28 2008

Keywords

Examples

			0;
1, 1;
1, 1, 1;
1, 1, 1, 2;
1, 1, 1, 1, 3;
1, 1, 1, 1, 1, 5;
1, 1, 1, 1, 1, 1, 8;
1, 1, 1, 1, 1, 1, 1, 13;
1, 1, 1, 1, 1, 1, 1, 1, 21;
1, 1, 1, 1, 1, 1, 1, 1, 1, 34;
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 55;
		

Crossrefs

Cf. A130296, A002062 (row sums)

Programs

  • Mathematica
    Table[Table[If[n == m, Fibonacci[n], 1], {n, 0, m}], {m, 0, 10}]; Flatten[%] Table[Apply[Plus, Table[If[n == m, Fibonacci[n], 1], {n, 0, m}]], {m, 0, 10}];

Formula

t(n,m)=If[n == m, Fibonacci[n], 1].
Previous Showing 11-12 of 12 results.