Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055807
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055807 Array T read by rows: T(i,j)=R(i-j,j), where R(i,0)=1 for i >= 0, R(0,j)=0 for j >= 1, R(i,j)=Sum{R(h,k): 0<=h<=i-1, 0<=k<=j} for i >= 1, j >= 1. +0
10
1, 1, 0, 1, 1, 0, 1, 3, 1, 0, 1, 7, 4, 1, 0, 1, 15, 12, 5, 1, 0, 1, 31, 32, 18, 6, 1, 0, 1, 63, 80, 56, 25, 7, 1, 0, 1, 127, 192, 160, 88, 33, 8, 1, 0, 1, 255, 448, 432, 280, 129, 42, 9, 1, 0, 1, 511, 1024, 1120, 832, 450, 180, 52, 10, 1, 0, 1, 1023 (list; table; graph; listen)
OFFSET

0,8

COMMENT

Formatted as a triangular array, it is [1, 0, 1, 1, 0, 0, 0, 0, 0, ...] DELTA [0, 1, 0, -1, 1, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 05 2006

EXAMPLE

Rows: 1; 1,0; 1,1,0; 1,3,1,0; 1,7,4,1,0; ...

CROSSREFS

Rows sums: A001519 (odd-indexed Fibonacci numbers).

T(2n, n)=A050146(n). Cf. A050143, A050147, A050148.

Sequence in context: A090181 A085791 A106800 this_sequence A054024 A048993 A112413

Adjacent sequences: A055804 A055805 A055806 this_sequence A055808 A055809 A055810

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), May 28 2000

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 July 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research