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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A242520 Number of cyclic arrangements of S={1,2,...,2n} such that the difference between any two neighbors is 3^k for some k=0,1,2,... 16
1, 1, 2, 3, 27, 165, 676, 3584, 19108, 80754, 386776, 1807342, 8218582, 114618650, 1410831012, 12144300991, 126350575684 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

a(n)=NPC(2n;S;P) is the count of all neighbor-property cycles for a specific set S of 2n elements and a specific pair-property P. For more details, see the link and A242519.

In this particular instance of NPC(n;S;P), all the terms with odd cycle lengths are necessarily zero.

LINKS

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

S. Sykora, On Neighbor-Property Cycles, Stan's Library, Volume V, 2014.

EXAMPLE

The two such cycles of length n=6 are:

C_1={1,2,3,6,5,4}, C_2={1,2,5,6,3,4}.

The first and last of the 27 such cycles of length n=10 are:

C_1={1,2,3,4,5,6,7,8,9,10}, C_27={1,4,7,8,5,2,3,6,9,10}.

PROG

(C++) See the link.

CROSSREFS

Cf. A242519, A242521, A242522, A242523, A242524, A242525, A242526, A242527, A242528, A242529, A242530, A242531, A242532, A242533, A242534.

Sequence in context: A184506 A126203 A126655 * A132533 A059089 A098812

Adjacent sequences:  A242517 A242518 A242519 * A242521 A242522 A242523

KEYWORD

nonn,hard,more

AUTHOR

Stanislav Sykora, May 27 2014

EXTENSIONS

a(14)-a(17) from Andrew Howroyd, Apr 05 2016

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified July 25 20:28 EDT 2017. Contains 289797 sequences.