login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294184 a(n) is the number of ways to arrange numbers from 1 to 2*n in a row, starting with 1, such that the sum of every two adjacent numbers is prime, but also considering the ends as adjacent. 0
1, 2, 2, 4, 96, 1024, 2880, 81024 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

When the size of the row is odd, it is impossible to find such an arrangement, so that sequence is only defined for even-sized rows.

LINKS

Table of n, a(n) for n=1..8.

EXAMPLE

a(1) = 1, because of [1, 2].

a(2) = 2, because of [1, 2, 3, 4] and [1, 4, 3, 2].

a(3) = 2, because of [1, 4, 3, 2, 5, 6] and [1, 6, 5, 2, 3, 4].

CROSSREFS

Cf. A036440.

Sequence in context: A067700 A270554 A037010 * A114695 A134084 A267346

Adjacent sequences:  A294181 A294182 A294183 * A294185 A294186 A294187

KEYWORD

nonn,more

AUTHOR

Michel Marcus, Feb 11 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 10:24 EDT 2019. Contains 328317 sequences. (Running on oeis4.)