Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049639
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049639 Array T read by diagonals; T(i,j)=number of lines passing through (i,j) and at least two other lattice points (h,k) satisfying 0<=h<=i, 0<=k<=j. +0
10
0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 4, 3, 4, 1, 1, 1, 1, 4, 4, 4, 4, 1, 1, 1, 1, 5, 4, 5, 4, 5, 1, 1, 1, 1, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 6, 5, 7, 5, 7, 5, 6, 1, 1, 1, 1, 6, 6, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 7, 6, 8, 7, 9, 7, 8, 6, 7, 1, 1 (list; table; graph; listen)
OFFSET

0,13

EXAMPLE

Diagonals (each starting on row 1): {0}; {0,0}; {1,0,1}; ...

CROSSREFS

It appears that A049639(n, k)=A049687(n/2, k/2).

Sequence in context: A061893 A078530 A010276 this_sequence A046555 A029382 A073780

Adjacent sequences: A049636 A049637 A049638 this_sequence A049640 A049641 A049642

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 July 8 18:40 EDT 2008. Contains 141013 sequences.


AT&T Labs Research