login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097082 Number of permutations p of (1,2,3,...,n) such that k+p(k) is a Fibonacci number for 1<=k<=n. 4
1, 1, 1, 2, 1, 2, 4, 2, 1, 4, 4, 20, 4, 5, 1, 20, 24, 8, 96, 200, 24, 4, 25, 1, 3, 200, 48, 288, 48, 64, 2304, 1600, 10800, 288, 432, 8, 675, 650, 1, 26, 9, 10400, 1600, 576, 2304, 23040, 576, 2560, 1024, 368640, 516096, 128000, 2240000, 5832000, 32256, 2304, 46656, 64, 96, 91125, 3750, 84500, 6, 1, 676, 9, 261 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

See A097083 for the values of n such that a(n)=1.

LINKS

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

FORMULA

a(n) = permanent(m), where the n X n matrix m is defined by m(i,j) = 1 or 0 depending on whether i+j is a Fibonacci number or not.

CROSSREFS

Cf. A073364, A095986, A097083.

Sequence in context: A082693 A225081 A307368 * A281729 A302290 A145173

Adjacent sequences:  A097079 A097080 A097081 * A097083 A097084 A097085

KEYWORD

nonn

AUTHOR

John W. Layman, Jul 23 2004

EXTENSIONS

a(30)-a(50) from Ray Chandler, Jul 26 2004

More terms from David Wasserman, Dec 19 2007

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 July 8 03:37 EDT 2020. Contains 335504 sequences. (Running on oeis4.)