id:A097082 - OEIS Search Results

Search: id:A097082

Displaying 1-1 of 1 results found.

page 1

Number of permutations p of (1,2,3,...,n) such that k+p(k) is a Fibonacci number for 1<=k<=n.

+0
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; listen)

	OFFSET	`1,4`
	COMMENT	`See A097083 for the values of n such that a(n)=1.`
	CROSSREFS	`Cf. A073364, A095986, A097083.` `Sequence in context: A059149 A013943 A082693 this_sequence A082793 A114929 A058573` `Adjacent sequences: A097079 A097080 A097081 this_sequence A097083 A097084 A097085`
	KEYWORD	`nonn`
	AUTHOR	`John W. Layman (layman(AT)math.vt.edu), Jul 23 2004`
	EXTENSIONS	`a(30)-a(50) from Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 26 2004` `More terms from David Wasserman (dwasserm(AT)earthlink.net), Dec 19 2007`

page 1

Search completed in 0.002 seconds

Last modified September 7 23:08 EDT 2008. Contains 143486 sequences.

AT&T Labs Research