id:A096901 - OEIS Search Results

Search: id:A096901

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 triangular number for 1<=k<=n.

+0
1

0, 1, 1, 0, 1, 1, 1, 2, 4, 3, 9, 14, 13, 52, 124, 161, 181, 715, 2338, 7073, 8624, 15466, 52858, 150365, 316543, 691771, 1681604, 5324919, 15407311, 37417775 (list; graph; listen)

	OFFSET	`1,8`
	CROSSREFS	`Cf. A006063, A073364, A095986, A097082, A097083, A096680.` `Sequence in context: A129596 A060837 A019600 this_sequence A100781 A110339 A075363` `Adjacent sequences: A096898 A096899 A096900 this_sequence A096902 A096903 A096904`
	KEYWORD	`more,nonn`
	AUTHOR	`Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 26 2004`
	EXTENSIONS	`More terms from David Wasserman (dwasserm(AT)earthlink.net), Nov 27 2007`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research