Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049765
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049765 Triangular array T read by rows: T(n,k)=(k mod n)+(n mod k), for k=1,2,...,n, n=1,2,.... +0
2
0, 1, 0, 1, 3, 0, 1, 2, 4, 0, 1, 3, 5, 5, 0, 1, 2, 3, 6, 6, 0, 1, 3, 4, 7, 7, 7, 0, 1, 2, 5, 4, 8, 8, 8, 0, 1, 3, 3, 5, 9, 9, 9, 9, 0, 1, 2, 4, 6, 5, 10, 10, 10, 10, 0, 1, 3, 5, 7, 6, 11, 11, 11, 11, 11, 0, 1, 2, 3, 4, 7, 6, 12, 12, 12, 12, 12, 0 (list; table; graph; listen)
OFFSET

1,5

EXAMPLE

Rows: {0}; {1,0}; {1,3,0}; ...

CROSSREFS

Sequence in context: A129555 A147755 A136748 this_sequence A014573 A067166 A125209

Adjacent sequences: A049762 A049763 A049764 this_sequence A049766 A049767 A049768

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research