Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048516
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048516 Array T read by diagonals: T(m,n)=number of subsets S of {1,2,3,...,m+n-1} such that |S|>1 and |a-b|>=m for all distinct a and b in S, m=1,2,3,...; n=1,2,3,... +0
1
0, 0, 1, 0, 4, 1, 0, 11, 3, 1, 0, 26, 7, 3, 1, 0, 57, 14, 6, 3, 1, 0, 120, 26, 11, 6, 3, 1, 0, 247, 46, 19, 10, 6, 3, 1, 0, 502, 79, 31, 16, 10, 6, 3, 1, 0, 1013, 133, 49, 25, 15, 10, 6, 3, 1, 0, 2036, 221, 76, 38, 22, 15, 10, 6, 3, 1, 0, 4083, 364 (list; table; graph; listen)
OFFSET

1,5

EXAMPLE

Diagonals: {0}; {1,0}; {4,1,0}; ...

CROSSREFS

Row 1 = A000295 (Eulerian nos.)

Row 2 = A001924 (Convolution of nat. nos. and Fibonacci nos.)

Sequence in context: A089962 A127155 A145880 this_sequence A060638 A007789 A081114

Adjacent sequences: A048513 A048514 A048515 this_sequence A048517 A048518 A048519

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research