|
Search: id:A051239
|
|
|
| A051239 |
|
Number of ways to arrange integers 1 through n so that the sum of each adjacent pair is prime, not counting reversals. |
|
+0
7
|
|
| 1, 1, 1, 4, 2, 8, 12, 30, 70, 664, 1072, 8768, 11648, 37108, 95772, 1059816, 2047488, 12111712, 22802028, 120779959, 337801784, 4361743860, 11425028900, 142573286216
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Similar to A036440, but not requiring 1 to be first and n to be last.
|
|
FORMULA
|
For n>1, A051239(n)=A103839(n)/2.
|
|
EXAMPLE
|
a(5)=2 since 1,4,3,2,5 and 3,4,1,2,5 have the property that the sum of each adjacent pair is prime.
|
|
CROSSREFS
|
Cf. A036440, A051237.
Sequence in context: A050128 A134042 A064821 this_sequence A002291 A110622 A130078
Adjacent sequences: A051236 A051237 A051238 this_sequence A051240 A051241 A051242
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Jud McCranie (j.mccranie(AT)comcast.net)
|
|
EXTENSIONS
|
More terms from Max Alekseyev, Jan 04 2008
|
|
|
Search completed in 0.002 seconds
|
