|
Search: id:A071059
|
|
|
| A071059 |
|
Number of ways of pairing even numbers in the range 1 to n with odd numbers in the range n+1 to 2n such that each pair sums to a prime. |
|
+0
3
|
|
| 1, 1, 1, 1, 1, 2, 2, 6, 4, 7, 6, 11, 11, 53, 53, 181, 171, 939, 925, 4432, 4545, 15811, 15583, 67891, 68193, 434963, 388975, 2718150, 3113343, 21580655
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
EXAMPLE
|
a(6)=2 because there are two ways: 2+9,4+7,6+11 and 2+11,4+9,6+7
|
|
CROSSREFS
|
The product of this sequence and A071058 gives A070897.
Sequence in context: A092686 A067804 A074911 this_sequence A061108 A053213 A140524
Adjacent sequences: A071056 A071057 A071058 this_sequence A071060 A071061 A071062
|
|
KEYWORD
|
hard,nice,nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), May 25 2002
|
|
EXTENSIONS
|
More terms from David W. Wilson, May 27, 2002
|
|
|
Search completed in 0.002 seconds
|
