Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077029
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A077029 Rectangle R(i,j) by antidiagonals; column j has j-1 zeros followed by numbers congruent to 1 mod j-1. +0
2
1, 1, 0, 1, 1, 0, 1, 2, 0, 0, 1, 3, 1, 0, 0, 1, 4, 3, 0, 0, 0, 1, 5, 5, 1, 0, 0, 0, 1, 6, 7, 4, 0, 0, 0, 0, 1, 7, 9, 7, 1, 0, 0, 0, 0, 1, 8, 11, 10, 5, 0, 0, 0, 0, 0, 1, 9, 13, 13, 9, 1, 0, 0, 0, 0, 0, 1, 10, 15, 16, 13, 6, 0, 0, 0, 0, 0, 0, 1, 11, 17, 19, 17, 11, 1, 0, 0, 0, 0, 0, 0, 1, 12, 19, 22 (list; table; graph; listen)
OFFSET

1,8

COMMENT

The number of occurrences of k is the number of divisors of k-1, for k>=2. Column 1 of the inverse of this infinite matrix begins with (1,-1,1,-1,2,-6,24,-120,6!,-7!,8!,-9!,...). The remaining columns are likewise expressible in terms of factorials.

FORMULA

R(i, j)=(i-j)(j-1)+1 if 1<=i<=j; R(i, j)=0 if j>=i+1.

EXAMPLE

Northwest corner:

1 0 0 0 0 0

1 1 0 0 0 0

1 2 1 0 0 0

1 3 3 1 0 0

1 4 5 4 1 0

1 5 7 7 5 1

CROSSREFS

Cf. A077028.

Sequence in context: A029373 A029362 A114510 this_sequence A079488 A052553 A045847

Adjacent sequences: A077026 A077027 A077028 this_sequence A077030 A077031 A077032

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Oct 19 2002

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 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research