|
Search: id:A132163
|
|
|
| A132163 |
|
Triangle read by rows. For row n, start with 1 but from the second term onwards always choose the largest positive integer between 1 and n inclusive that i) has not already appeared in the row ii) gives a prime when added to the previous term. Stop if no such integer can be found. |
|
+0
2
|
|
| 1, 1, 2, 1, 2, 3, 1, 4, 3, 2, 1, 4, 3, 2, 5, 1, 6, 5, 2, 3, 4, 1, 6, 7, 4, 3, 2, 5, 1, 6, 7, 4, 3, 8, 5, 2, 1, 6, 7, 4, 9, 8, 5, 2, 3, 1, 10, 9, 8, 5, 6, 7, 4, 3, 2, 1, 10, 9, 8, 11, 6, 7, 4, 3, 2, 5, 1, 12, 11, 8, 9, 10, 7, 6, 5, 2, 3, 4
(list; table; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
The following statements are conjectural: 1) The n-th row is always a permutation of 1,...,n. 2) For the even rows, the last term is one less than a prime (so the row gives a solution to the prime circle problem - see A051252). 3) There exists a (unique) sequence b(2), b(3),... with the property that for every n > 1 there is a positive integer N such that every even row of the triangle from the 2N-th onwards ends b(n), ..., b(3), b(2) and every odd row from the (2N - 1)-th onwards ends b(n)+(-1)^n, ..., b(3)-1, b(2)+1. (If the sequence b(n) exists it is probably A132075 without the initial term 1.)
|
|
CROSSREFS
|
This sequence is a variation on A088643.
Sequence in context: A021475 A132224 A133299 this_sequence A110582 A091298 A055884
Adjacent sequences: A132160 A132161 A132162 this_sequence A132164 A132165 A132166
|
|
KEYWORD
|
easy,nice,nonn,tabl
|
|
AUTHOR
|
Paul Boddington (pbotherstuff(AT)yahoo.co.uk), Nov 04 2007
|
|
|
Search completed in 0.002 seconds
|
