|
Search: id:A082009
|
|
|
| A082009 |
|
In the following square array numbers (not occurring earlier) are entered like this a(1,1),a(1,2),a(2,1),a(3,1),a(2,2),a(1,3),a(1,4),a(2,3),a(3,2),a(4,1),a(5,1),a(4,2),... such that every entry is coprime to the members of the row and column it belongs, with the condition that the n-th diagonal sum is a multiple of n. 1 2 7 9 31 25... 4 5 11 23 27... 3 13 8... 19 21... 17 ... ... a(n) = sum b(i,j) i+j = n. Or the sum of the n-th diagonal making 45 degree angle with the positive x axis ( which a multiple of n by definition). |
|
+0
5
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
This should exhibit some number-theoretic properties.
|
|
CROSSREFS
|
Cf. A082006, A082007, A082008, A082010.
Sequence in context: A051610 A056423 A056347 this_sequence A122365 A119132 A073065
Adjacent sequences: A082006 A082007 A082008 this_sequence A082010 A082011 A082012
|
|
KEYWORD
|
more,nonn,uned
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 05 2003
|
|
EXTENSIONS
|
Needs editing - see A082002, A082003, A082004, A082005 for a model. - njas
|
|
|
Search completed in 0.002 seconds
|
