Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109754
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109754 Matrix defined by: a(i,0) = 0, a(i,j) = i*Fibonacci[j-1] + Fibonacci[j], for j > 0; read by antidiagonals. +0
28
0, 0, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 3, 3, 3, 0, 1, 4, 4, 5, 5, 0, 1, 5, 5, 7, 8, 8, 0, 1, 6, 6, 9, 11, 13, 13, 0, 1, 7, 7, 11, 14, 18, 21, 21 (list; table; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research