|
Search: id:A082011
|
|
|
| A082011 |
|
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 a prime with the condition that the n-th diagonal sum is a multiple of n. 2 3 19 11 53... 5 13 17 43... 7 23 41... 29 37... 31... ... sequence contains terms as they are entered. |
|
+0
5
|
|
| 2, 3, 5, 7, 13, 19, 11, 17, 23, 29, 31, 37, 41, 43, 53
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The term a(2,2) is 13 and not 11 as 7 + 11 = 18 and no prime can be placed at a(3,1) to satisfy the requirement.
|
|
CROSSREFS
|
Cf. A082012, A082013, A082014, A082015.
Adjacent sequences: A082008 A082009 A082010 this_sequence A082012 A082013 A082014
Sequence in context: A076047 A077132 A077316 this_sequence A101044 A100786 A077321
|
|
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
|
