Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133922
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133922 a(n) = number of permutations (p(1),p(2),p(3),...p(n)) of (1,2,3,...n) such that p(k) is coprime to p(n+1-k) for k = all positive integers <=n. +0
1
1, 2, 2, 16, 16 (list; graph; listen)
OFFSET

1,2

COMMENT

For n = odd integer the middle term of all counted permutations must be 1.

EXAMPLE

For n = 6, the permutation (3,2,1,6,4,5) is not counted because p(2)=2 is not coprime to p(5)=4. However, the permutation (3,6,1,4,5,2) is counted because GCD(3,2) = GCD(6,5) = GCD(1,4) = 1.

CROSSREFS

Sequence in context: A112327 A093114 A016740 this_sequence A088139 A113123 A076615

Adjacent sequences: A133919 A133920 A133921 this_sequence A133923 A133924 A133925

KEYWORD

more,nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jan 07 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 21:35 EST 2008. Contains 151309 sequences.


AT&T Labs Research